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

A. It is a hybrid sorting algorithm combining Merge Sort and Insertion Sort.

B. It is a stable sort.

C. It uses less memory.

D. It is efficient for small arrays.

A. Heap Sort

B. Quick Sort

C. Selection Sort

D. Insertion Sort

A. When the data is partially sorted.

B. When the data is sorted in reverse.

C. When the data is unsorted.

D. When the data is very small.

A. Hybrid

B. Non-comparison-based

C. Stable sort

D. Hybrid

A. Quick Sort

B. Merge Sort

C. Counting Sort

D. Radix Sort

A. True

B. False

A. 7 and 8

B. 5 and 6

C. 5 and 5

D. 4 and 5

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. O(n)

B. O(1)

C. O(log n)

D. O(n log n)

A. bogo sort

B. sleep sort

C. cube sort

D. merge sort