Sorting Algorithms - Study Mode

Show All Answers

[#221] Which sorting algorithm does not work efficiently for arrays with large ranges of integer keys?

(A) Quick Sort

(B) Merge Sort

(C) Counting Sort

(D) Radix Sort

Correct Answer

(C) Counting Sort

[#222] Shell sort is more efficient than insertion sort if the length of input arrays is small.

(A) True

(B) False

Correct Answer

(B) False

[#223] The given array is arr={7, 4, 5, 8, 1, 2}. The number of iterations required to sort the array using comb sort and bubble sort respectively will be . . . . . . . .

(A) 7 and 8

(B) 5 and 6

(C) 5 and 5

(D) 4 and 5

Correct Answer

(D) 4 and 5

[#224] What is the auxiliary space complexity of merge sort?

(A) O(1)

(B) O(log n)

(C) O(n)

(D) O(n log n)

Correct Answer

(C) O(n)

[#225] What is the auxiliary space requirement of permutation sort?

(A) O(n)

(B) O(1)

(C) O(log n)

(D) O(n log n)

Correct Answer

(B) O(1)