Sorting Algorithms - Study Mode
[#261] What is the average case time complexity of recursive insertion sort?
Correct Answer
(C) O(n 2 )
[#262] How many comparisons will be made in the worst case when an array of size n will be sorted by using a binary insertion sort algorithm?
Correct Answer
(C) log n
[#263] In which of the following case stooge sort is most efficient (in terms of time complexity)?
Correct Answer
(D) it has the same time complexity in any case
[#264] Recursive insertion sort is a comparison based sort.
Correct Answer
(A) True
[#265] Which of the following real time examples is based on insertion sort?
Correct Answer
(A) arranging a pack of playing cards