Binary insertion sort

Computer Science Level pending

The standard \(\Theta(n^{2})\) implementation of insertion sort on an array uses linear search to identify the position to insert an element into an already sorted sub-array. Now suppose we use a binary search to identify the position to insert an element, what will be the worst-case running time of the new algorithm?

×

Problem Loading...

Note Loading...

Set Loading...