What does it mean for a sorting algorithm to be 'stable'?

Mediumdsasorting-stability

Elements with equal values retain their relative original order after sortingCorrect answer
The algorithm never makes any comparisons
The algorithm always runs in constant time
The algorithm cannot sort more than 10 elements

Show answer & explanation

Correct answer: A. Elements with equal values retain their relative original order after sorting

Explanation

A stable sort preserves the relative order of elements that compare as equal, which matters in certain applications.

Practise 3 questions on this topic

Take Sorting & Searching — Timed Test (3 questions) — scored instantly, explanation for every question, no login.

Mediumdsasorting-stability

Elements with equal values retain their relative original order after sortingCorrect answer
The algorithm never makes any comparisons
The algorithm always runs in constant time
The algorithm cannot sort more than 10 elements

Show answer & explanation

Correct answer: A. Elements with equal values retain their relative original order after sorting

Explanation

A stable sort preserves the relative order of elements that compare as equal, which matters in certain applications.

Practise 3 questions on this topic

Take Sorting & Searching — Timed Test (3 questions) — scored instantly, explanation for every question, no login.

Related questions