Mind map
Stability in sorting algorithms
Map content
Stability in sorting algorithms
i < j and A[i] ∼ A[j] implies π(i) < π( j)
Equivalent elements retain their relative positions after sorting.
best sorting algorithms are not stable.
- Quicksort
- heapsort
- Mergesort*
Any sorting algorithm may be made stable, at a price:
- Price: O(n)+
C++ and java libraries
Images and files in the map
Information
- Description
- Mind Map on Stability in sorting algorithms, created by Esteban yusunguaira on 10/02/2020.
- Created by
- Esteban yusunguaira
- Views
- 0
- Rating