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

A. Merge Sort

B. Quick Sort

C. Insertion Sort

D. Heap Sort

A. Selection Sort

B. Bubble Sort

C. Counting Sort

D. Radix Sort

A. Quick Sort

B. Merge Sort

C. Insertion Sort

D. Heap Sort

A. O(n²)

B. O(n log n)

C. O(log n)

D. O(n²)

A. Merge Sort

B. Insertion Sort

C. Selection Sort

D. Bubble Sort

A. O(n)

B. O(k)

C. O(1)

D. O(n + k)

A. When stable sorting is required and the data is large.

B. When space is limited.

C. When the data is almost sorted.

D. When the data set is very small.

A. Counting Sort

B. Heap Sort

C. Merge Sort

D. Quick Sort

A. It is not a stable sort.

B. It requires additional memory.

C. It is inefficient for large datasets.

D. It cannot sort linked lists.

A. Insertion Sort

B. Radix Sort

C. Quick Sort

D. Insertion Sort