Sorting Algorithms - Study Mode
[#151] The initial gap between two elements being compared . . . . . . . .
Correct Answer
(A) is equal to number of elements in the array
[#152] What will be the pivot for the array arr={8, 2, 4, 9} for making the first partition when a median of three quick sort is implemented?
Correct Answer
(A) 8
[#153] How many elements can be sorted in O(logn) time using Heap sort?
Correct Answer
(C) O(logn/log(logn))
[#154] What is the auxiliary space complexity of tree sort?
Correct Answer
(B) O(n)
[#155] What is the best case time complexity of cycle sort?
Correct Answer
(A) O(n 2 )