Selection Sort and Quick Select Flashcards
1
Q
When to use Selection Sort?
A
When data moves are high in cost and comparisons are low in costs.
When inputs n are small.
2
Q
Finding the median element of an unsorted array can be solved in :
A
O(n log(n))
3
Q
Quickselect Best Case Running Time
A
θ(n)
4
Q
Quickselect Average Case Running Time
A
θ(n)
5
Q
Quickselect Worst Case Running Time
A
θ(n^2)
