Sorting Algorithms - Study Mode
[#316] What is the worst case time complexity of merge sort?
Correct Answer
(A) O(n log n)
[#317] Introsort begins sorting the given array by using which of the following sorting algorithm?
Correct Answer
(B) quick sort
[#318] Quick Sort is a . . . . . . . .
Correct Answer
(B) divide and conquer algorithm
[#319] What is the worst space complexity of bucket sort (k = number of buckets)?
Correct Answer
(B) O(n.k)
[#320] How many odd and even phases are required respectively to sort the given array using odd-even sort.arr={3, 2, 3, 8, 5, 6, 2, 1}.
Correct Answer
(B) 4,4