Mapa mental
Sorting and Selection
Contenido del mapa
Sorting and Selection
Quick-Sort
- Based on the divide-and-conquer paradigm
- Input sequences processed
- Output sequences generated
- Running time
- O(n log n) Worst case time: O(n**2)
- Randomized Quick-Sort
- Picking Pivots at Random
- Pick an element of the sequence at random as the pivot, keeping the rest of the algorithm unchanged
- Picking Pivots at Random
- Based on the divide-and-conquer paradigm
Imágenes y archivos del mapa
Información
- Descripción
- Mapa Mental sobre Sorting and Selection, creado por Angelica Cordero el 25/05/2022.
- Creado por
- Angelica Cordero
- Visitas
- 0
- Valoración