Sorting Algorithms - Study Mode
[#431] Median of three quick sort is an in place sort.
Correct Answer
(A) true
[#432] Which of the following sorting algorithm is best suited if the elements are already sorted?
Correct Answer
(C) Insertion Sort
[#433] The given array is arr = {1, 2, 4, 3, 5}.The number of iterations required to sort the array using gnome sort will be . . . . . . . .
Correct Answer
(B) 6
[#434] What is the disadvantage of selection sort?
Correct Answer
(B) It is not scalable
[#435] Gnome sort uses which of the following method to implement sorting?
Correct Answer
(D) Exchanging