0 votes 0 votes if Insertion sort use Binary search instead of Linear search Worst case O(n*n) Best case n or n*n ? Average case n*n or n*logn ?? Abhisek Tiwari 4 asked Jan 2, 2019 Abhisek Tiwari 4 277 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Abhisek Tiwari 4 commented Jan 2, 2019 reply Follow Share @Shaik Masthan sir please verify 3rd point @aimhigh what will be no of reduced comp? 0 votes 0 votes Shaik Masthan commented Jan 2, 2019 reply Follow Share Insertion sort using binary search just decreases number of comparisons but don't change its complexity yes. what will be no of reduced comp? if normally we have 'n' comparissions, using binary search it decreses to ' log n ' comparission. 2 votes 2 votes aimhigh commented Jan 2, 2019 reply Follow Share "if normally we have 'n' comparissions, using binary search it decreses to ' log n ' comparission." Yes. 0 votes 0 votes Please log in or register to add a comment.