Sorting Algorithms - Study Mode
[#311] Binary tree sort is an in-place sorting algorithm.
Correct Answer
(B) False
[#312] In which of the following case strand sort is most efficient?
Correct Answer
(A) when input array is already sorted
[#313] What is the best case time complexity of cube sort?
Correct Answer
(B) O(n)
[#314] Binary search can be used in an insertion sort algorithm to reduce the number of comparisons.
Correct Answer
(A) True
[#315] What is the worst case time complexity of gnome sort?
Correct Answer
(B) O(n 2 )