100.
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?

Read More Section(Sorting Algorithms)

Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.