Sorting Algorithms - Study Mode
[#406] What is the time complexity of Bubble Sort in the average case?
Correct Answer
(C) O(n 2 )
[#407] Which sorting algorithm is based on the divide-and-conquer strategy?
Correct Answer
(B) Quick Sort
[#408] What is the space complexity of Merge Sort?
Correct Answer
(C) O(n)
[#409] Which sorting algorithm uses a "pivot" element to partition the array into sub-arrays?
Correct Answer
(D) Quick Sort
[#410] What is the primary advantage of Heap Sort over Quick Sort?
Correct Answer
(A) It has a guaranteed time complexity of O(n log n) in the worst case.