juniorSorting
What is a Stable Sorting Algorithm?
Updated Apr 28, 2026
Short answer
A sort that preserves the relative order of elements with equal keys.
Deep explanation
Sorting is the process of arranging data in a specific order. A sort that preserves the relative order of elements with equal keys. Fundamental sorts are essential for understanding algorithmic trade-offs.
Real-world example
Sorting a hand of cards during a game.
Common mistakes
- Assuming O(n^2) algorithms are suitable for large production datasets.
Follow-up questions
- What is the worst-case for Bubble Sort?