Selection Sort

Properties

Time complexity:

Worst	Average	Best
$\theta (N^2)$	$\theta (N^2)$	$\theta (N^2)$

Space complexity auxiliary:

Worst	Average	Best
$\theta (1)$	$\theta (1)$	$\theta (1)$

Stability: not stable

Adaptivity: not-adaptive

Online: no

Heapsort

Heapsort is just a selection sort backed by a heap rather than array.

References

• Selection sort - Wikipedia