Sorting Algorithms - Study Mode

Show All Answers

[#141] What is the disadvantage of counting sort?

(A) counting sort has large time complexity

(B) counting sort has large space complexity

(C) counting sort is not a comparison based sorting technique

(D) counting sort cannot be used for array with non integer elements

Correct Answer

(D) counting sort cannot be used for array with non integer elements

[#142] Auxiliary space used by gnome sort is . . . . . . . .

(A) O(1)

(B) O(n)

(C) O(log n)

(D) O(n log n)

Correct Answer

(A) O(1)

[#143] What is the purpose of using randomized quick sort over standard quick sort?

(A) so as to avoid worst case time complexity

(B) so as to avoid worst case space complexity

(C) to improve accuracy of output

(D) to improve average case time complexity

Correct Answer

(A) so as to avoid worst case time complexity

[#144] What is the purpose of using a median of three quick sort over standard quick sort?

(A) so as to avoid worst case time complexity

(B) so as to avoid worst case space complexity

(C) to improve accuracy of output

(D) to improve average case time complexity

Correct Answer

(A) so as to avoid worst case time complexity

[#145] Bucket sort is a generalization of which of the following sort?

(A) LSD radix sort

(B) Pigeonhole sort

(C) Counting sort

(D) MSD radix sort

Correct Answer

(B) Pigeonhole sort