Mapa mental
Quick Sort
Contenido del mapa
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)
Información
- Descripción
- Bachelors (Advanced Programming) Computer Science Mapa Mental sobre Quick Sort, creado por Ian Arbuckle el 05/01/2016.
- Creado por
- Ian Arbuckle
- Visitas
- 2
- Valoración