Sorting Algorithms - Study Mode
[#356] What is the best case time complexity of bogosort?
Correct Answer
(B) O(n)
[#357] The given array is arr = {3, 4, 5, 2, 1}. The number of iterations in bubble sort and selection sort respectively are . . . . . . . .
Correct Answer
(A) 5 and 4
[#358] In heap sort, after deleting the last minimum element, the array will contain elements in?
Correct Answer
(D) decreasing sorting order
[#359] Median of three quick sort is a stable sort.
Correct Answer
(B) false
[#360] Which of the following is not an advantage of tree sort?
Correct Answer
(A) it has a low space complexity