Sorting Algorithms - Study Mode
[#286] Consider the Quick sort algorithm which sorts elements in ascending order using the first element as pivot. Then which of the following input sequence will require a maximum number of comparisons when this algorithm is applied on it?
Correct Answer
(A) 22 25 56 67 89
[#287] Sleep sort is an in-place sorting technique.
Correct Answer
(A) True
[#288] Which of the following sorting techniques is stable?
Correct Answer
(B) counting sort
[#289] Which of the following sorting algorithm makes use of merge sort?
Correct Answer
(A) tim sort
[#290] Merge sort uses which of the following algorithm to implement sorting?
Correct Answer
(C) divide and conquer