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

A. Merge Sort

B. Quick Sort

C. Heap Sort

D. Selection Sort

A. By directly sorting large numbers.

B. By using a comparison-based approach.

C. By dividing numbers into smaller groups.

D. By sorting numbers digit by digit using a stable sort algorithm.

A. O(n log n)

B. O(n)

C. O(n²)

D. O(log n)

A. Heap Sort

B. Merge Sort

C. Insertion Sort

D. Heap Sort

A. Merge Sort uses less space than Quick Sort.

B. Quick Sort is stable, while Merge Sort is not.

C. Merge Sort is stable and uses additional space, while Quick Sort is not stable and uses in-place sorting.

D. Merge Sort is faster than Quick Sort.

A. Bubble Sort

B. Quick Sort

C. Selection Sort

D. Merge Sort

A. O(n + k)

B. O(n log n)

C. O(k)

D. O(n²)

A. Counting Sort

B. Insertion Sort

C. Heap Sort

D. Merge Sort

A. Binary Search Tree

B. AVL Tree

C. Binary Heap

D. Hash Table

A. Heap Sort

B. Merge Sort

C. Radix Sort

D. Heap Sort