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

A. Sorting elements based on their frequency.

B. Sorting elements by swapping.

C. Distributing elements into buckets and sorting each bucket individually.

D. Sorting elements by comparing them.

A. Merge Sort

B. Quick Sort

C. Heap Sort

D. Counting Sort

A. O(n log n)

B. O(n²)

C. O(n)

D. O(log n)

A. Radix Sort

B. Counting Sort

C. Merge Sort

D. Quick Sort

A. Bubble Sort

B. Selection Sort

C. Radix Sort

D. Insertion Sort

A. It does not require extra space.

B. It combines the best aspects of Merge Sort and Insertion Sort.

C. It is easier to implement.

D. It does not require extra space.

A. When you need a stable sort.

B. When the array is very small.

C. When the array is large and unsorted.

D. When the array is nearly sorted.

A. O(n)

B. O(n²)

C. O(log n)

D. O(n log n)

A. Heap Sort

B. Merge Sort

C. Radix Sort

D. Quick Sort

A. It requires additional space.

B. It is not efficient for small arrays.

C. It is not stable.

D. It has a worst-case time complexity of O(n²).