Sorting Algorithms - Study Mode

[#306] What is the worst case complexity of bubble sort?
Correct Answer

(D) O(n 2 )

[#307] What is the auxiliary space complexity of randomized quick sort?
Correct Answer

(C) O(log n)

[#308] What is the best case time complexity of recursive bubble sort?
Correct Answer

(A) O(n)

[#309] On how many increment sequences does the worst case analysis of shell sort depends?
Correct Answer

(C) three

[#310] What is the advantage of radix sort over quick sort?
Correct Answer

(A) radix sort performs better than quick sort when we have log n bits for every digit