Sorting Algorithms MCQ question and answer with solution | Data Structure MCQs

A. stooge sort

B. strand sort

C. quick sort

D. bubble sort

A. O(n²)

B. O(n*n!)

C. O(infinity)

D. O(n log n)

A. pigeonhole sort

B. heap sort

C. comb sort

D. cycle sort

A. 16

B. n²

C. n log(n)

D. 2 log (n)

A. O(n)

B. O(1)

C. O(n log n)

D. O(n²)

A. O(n)

B. O(n²)

C. O(n log n)

D. O(log n)

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

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

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

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