The usual θ(n^2) implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running time will
A:remain θ(n^2)
B: become θ(n(log n)^2)
C:become θ(n log n)
D:become θ(n)
Answer: A
Click for Solution
  Asked in CIL