Q500
The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?
A.
O(nlogn)
B.
O(n2)
AnswerC.
O(n)
D.
O(logn)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board