Mindmap
Quick Sort
Inhalt der Mindmap
Quick Sort
Divide
- Divide the problem into two smaller ones => partition the collection into 2 smaller sub-collections
Conquer
- Conquer by solving the smaller ones => sort recursively each sub-collection
Combine
- Combine the two sorted sub-partitions
Runs the fastest when median is chosen as pivot
O(N log^2 N)
Informationen
- Beschreibung
- Bachelors Computer Science (Advanced Programming) Mindmap am Quick Sort, erstellt von Ian Arbuckle am 05/01/2016.
- Erstellt von
- Ian Arbuckle
- Aufrufe
- 2
- Bewertung