Question: Observe that the while loop of lines 5 7 of the

Observe that the while loop of lines 5 - 7 of the INSERTION-SORT procedure in Section 2.1 uses a linear search to scan (backward) through the sorted subarray A[1 ¬ j - 1]. Can we use a binary search (see Exercise 2.3-5) instead to improve the overall worst-case running time of insertion sort to Θ(n lg n)?


Sale on SolutionInn
Sales0
Views799
Comments
  • CreatedJuly 12, 2010
  • Files Included
Post your question
5000