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

A. O(n log n)

B. O(n)

C. O(n²)

D. O(n³)

A. Insertion Sort

B. Quick Sort

C. Selection Sort

D. Insertion Sort

A. O(n²)

B. O(1)

C. O(n)

D. O(log n)

A. Merge Sort

B. Heap Sort

C. Counting Sort

D. Quick Sort

A. It has a guaranteed time complexity of O(n log n) in the worst case.

B. It is stable.

C. It sorts the data in place.

D. It uses less memory than Merge Sort.

A. Selection Sort

B. Quick Sort

C. Heap Sort

D. Merge Sort

A. When the array is in random order.

B. When the array is sorted in reverse order.

C. When the array is already sorted or nearly sorted.

D. When the array has duplicate elements.

A. O(n)

B. O(n²)

C. O(log n)

D. O(n)

A. Counting Sort

B. Heap Sort

C. Insertion Sort

D. Merge Sort

A. It is slower than other sorting algorithms.

B. It is not a stable sort.

C. It does not work with negative numbers.

D. It requires a large amount of memory for large range of input values.