Stable Sort

Learn which algorithms are regarded as stable sorting algorithms.


A sorting method is stable if two elements with identical key values appear in the same order in the sorted output as they do in the unsorted input. Stable sorting algorithms guarantee that elements with identical keys will not be reordered.

Summary of sorting algorithms

The following table summarizes the sorting algorithms with respect to their complexities and stability.

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.