Mindmap
Stability in sorting algorithms
Inhalt der Mindmap
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
Bilder und Dateien der Mindmap
Informationen
- Beschreibung
- Mindmap am Stability in sorting algorithms, erstellt von Esteban yusunguaira am 10/02/2020.
- Erstellt von
- Esteban yusunguaira
- Aufrufe
- 0
- Bewertung