Data Structures 300 Unique MCQs

Merge Sort fits because it supports stable sorting with guaranteed O(n log n) time and its merge step usually needs auxiliary storage for arrays.
Both clues point to this choice.

Insertion Sort is commonly used for small or nearly sorted datasets.
Its design supports this task efficiently or naturally.

The defining property is that it is adaptive to existing order.
The other statements describe different structures or concepts.

Insertion Sort fits because it supports small or nearly sorted datasets and it is adaptive to existing order.
Both clues point to this choice.

Merge Sort is a divide-and-conquer sort that merges sorted subarrays.
This description distinguishes it from the other choices.

Merge Sort is commonly used for stable sorting with guaranteed O(n log n) time.
Its design supports this task efficiently or naturally.

The defining property is that its merge step usually needs auxiliary storage for arrays.
The other statements describe different structures or concepts.

Bubble Sort is commonly used for teaching basic sorting mechanics.
Its design supports this task efficiently or naturally.

The defining property is that after each full pass, an extreme element reaches its final region.
The other statements describe different structures or concepts.

Bubble Sort fits because it supports teaching basic sorting mechanics and after each full pass, an extreme element reaches its final region.
Both clues point to this choice.

Selection Sort is a comparison sort that repeatedly selects the smallest remaining element.
This description distinguishes it from the other choices.

Selection Sort is commonly used for sorting when minimizing swaps is useful.
Its design supports this task efficiently or naturally.