Sorting Algorithms - Study Mode
[#291] What is the average time complexity of bottom up merge sort?
Correct Answer
(A) O(n log n)
[#292] Which of the following is a combination of LSD and MSD radix sorts?
Correct Answer
(A) Forward radix sort
[#293] How many comparisons will be made to sort the array arr={1, 5, 3, 8, 2} using counting sort?
Correct Answer
(D) 0
[#294] Shell sort algorithm is the first algorithm to break the quadratic time barrier.
Correct Answer
(A) True
[#295] What is the advantage of pigeonhole sort over merge sort?
Correct Answer
(A) pigeonhole sort has lesser time complexity when range is comparable to number of input elements