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