PRACTICE • LEARN • GROW

Sorting MCQs

Solve topic-wise placement questions and improve your skills.

Sorting Progress

0 of 25 completed

0% Topic Track

1

Which of the following sorting algorithms is NOT stable in its standard implementation?

A. Merge Sort

B. Quick Sort

C. Insertion Sort

D. Bubble Sort

2

What is the worst-case time complexity of QuickSort when pivot is always the smallest or largest element?

A. O(N log N)

B. O(N^2)

C. O(N)

D. O(log N)

3

What is the space complexity of standard Merge Sort for an array of size N?

A. O(1)

B. O(N)

C. O(log N)

D. O(N^2)

4

Which sorting algorithm is ideal for nearly sorted arrays (e.g. at most k positions away from sorted position)?

A. Insertion Sort / Min-Heap

B. Selection Sort

C. Quick Sort

D. Radix Sort

5

What is the theoretical lower bound for any comparison-based sorting algorithm?

A. O(N)

B. O(N log N)

C. O(log N)

D. O(N^2)

6

What is the time complexity and stability of Heap Sort on an array of size N (Variation 6)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

7

What is the time complexity and stability of Heap Sort on an array of size N (Variation 7)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

8

What is the time complexity and stability of Heap Sort on an array of size N (Variation 8)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

9

What is the time complexity and stability of Heap Sort on an array of size N (Variation 9)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

10

What is the time complexity and stability of Heap Sort on an array of size N (Variation 10)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

11

What is the time complexity and stability of Heap Sort on an array of size N (Variation 11)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

12

What is the time complexity and stability of Heap Sort on an array of size N (Variation 12)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

13

What is the time complexity and stability of Heap Sort on an array of size N (Variation 13)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

14

What is the time complexity and stability of Heap Sort on an array of size N (Variation 14)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

15

What is the time complexity and stability of Heap Sort on an array of size N (Variation 15)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

16

What is the time complexity and stability of Heap Sort on an array of size N (Variation 16)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

17

What is the time complexity and stability of Heap Sort on an array of size N (Variation 17)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

18

What is the time complexity and stability of Heap Sort on an array of size N (Variation 18)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

19

What is the time complexity and stability of Heap Sort on an array of size N (Variation 19)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

20

What is the time complexity and stability of Heap Sort on an array of size N (Variation 20)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

21

What is the time complexity and stability of Heap Sort on an array of size N (Variation 21)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

22

What is the time complexity and stability of Heap Sort on an array of size N (Variation 22)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

23

What is the time complexity and stability of Heap Sort on an array of size N (Variation 23)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

24

What is the time complexity and stability of Heap Sort on an array of size N (Variation 24)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

25

What is the time complexity and stability of Heap Sort on an array of size N (Variation 25)?

A. O(N log N) time and unstable

B. O(N^2) time and stable

C. O(N) time and stable

D. O(log N) time and unstable

Question Palette

Answered

Current

Not Attempted

Wrong