Sorting Algorithms - Study Mode
[#186] Heap sort is faster than Shell sort.
Correct Answer
(B) false
[#187] Statement 1: In insertion sort, after m passes through the array, the first m elements are in sorted order. Statement 2: And these elements are the m smallest elements in the array.
Correct Answer
(B) Statement 1 is true but statement 2 is false
[#188] What is the average time complexity of randomized quick sort?
Correct Answer
(A) O(n log n)
[#189] Bead sort is also known as . . . . . . . .
Correct Answer
(A) gravity sort
[#190] What is the average case complexity of selection sort?
Correct Answer
(D) O(n 2 )