All MCQs

Stable Sorting fits because it supports multi-key sorting and equal-key records remain in their original relative order.
Both clues point to this choice.

The defining property is that equal-key records remain in their original relative order.
The other statements describe different structures or concepts.

Stable Sorting is commonly used for multi-key sorting.
Its design supports this task efficiently or naturally.

Stable Sorting is a sorting property that preserves the relative order of equal keys.
This description distinguishes it from the other choices.

Bucket Sort fits because it supports uniformly distributed numeric data and performance depends on how evenly items spread across buckets.
Both clues point to this choice.

The defining property is that performance depends on how evenly items spread across buckets.
The other statements describe different structures or concepts.

Bucket Sort is commonly used for uniformly distributed numeric data.
Its design supports this task efficiently or naturally.

Bucket Sort is a distribution sort that places values into buckets before sorting within them.
This description distinguishes it from the other choices.

Radix Sort fits because it supports sorting fixed-length integers or strings and each digit pass must use a stable subroutine in common LSD implementations.
Both clues point to this choice.

The defining property is that each digit pass must use a stable subroutine in common LSD implementations.
The other statements describe different structures or concepts.

Radix Sort is commonly used for sorting fixed-length integers or strings.
Its design supports this task efficiently or naturally.

Radix Sort is a non-comparison sort that processes keys digit or group by digit.
This description distinguishes it from the other choices.