Mind map
Quick Sort
Map content
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)
Information
- Description
- Bachelors Computer Science (Advanced Programming) Mind Map on Quick Sort, created by Ian Arbuckle on 05/01/2016.
- Created by
- Ian Arbuckle
- Views
- 2
- Rating