Blog

Your dream job? Lets Git IT.
Interactive technical interview preparation platform designed for modern developers.

XGitHub

Platform

  • Categories

Resources

  • Blog
  • About the app
  • FAQ
  • Feedback

Legal

  • Privacy Policy
  • Terms of Service

© 2025 LetsGit.IT. All rights reserved.

LetsGit.IT/Categories/Algorithms
Algorithmsmedium

What does it mean that a sort is stable, and why does it matter?

Tags
#sorting#stable-sort#algorithm
Back to categoryPractice quiz

Answer

A stable sort keeps the relative order of elements with equal keys. It matters when you sort by multiple fields (e.g., sort by last name, then by first name).

Related questions

Algorithms
Heap sort: what are its time complexity, space complexity, and stability?
#heapsort#sorting#complexity
Algorithms
Counting sort: when can it be faster than O(n log n) sorting?
#counting-sort#sorting#stability
Algorithms
What is Dijkstra's Algorithm?
#graph#shortest-path#dijkstra
Algorithms
QuickSort vs MergeSort?
#sorting#quicksort#mergesort
Algorithms
Explain Binary Search.
#search#binary-search#algorithm