Selection sort and insertion sort are both O(n^2) average and worst-case; For heapsort, see Heap data structure above; Not required, but I recommended them: Sedgewick - Radix Sorts (6 videos) 1.