Mindmap
Sorting
Inhalt der Mindmap
Sorting
Insertion sort
- Best Case = O(n) Worst Case = O(n^2) Average Case = O(n^2)
Mergesort
- Best / Worst / Average Case = O(n log n)
Selection Sort
- Best Case = O(n) Worst Case = O(n^2) Average Case = O(n^2)
Quick sort (Pivot)
- Best case = O(n log n) Worst case = O(n^2)
Heap
- Insertion / Deletion= O(log n)
- Heapsort = O(n log n)
Binary Search Tree
- CRUD = O(h) where h is height
- Average case = O(log n)
Informationen
- Beschreibung
- Mindmap am Sorting, erstellt von dadelgado01 am 11/11/2014.
- Erstellt von
- dadelgado01 · Nov 2014
- Aktualisiert
- 19 Feb 2016
- Aufrufe
- 14
- Bewertung