Mind map
Sorting and Selection
Map content
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
Images and files in the map
Information
- Description
- Mind Map on Sorting and Selection, created by Angelica Cordero on 25/05/2022.
- Created by
- Angelica Cordero
- Views
- 0
- Rating