Question

Algorithm for sorting cards

Answer 1

Explanation:

(1) selection sort – always O(N2)

(2) insertion sort – worst case O(N2), but O(N) if already sorted.

(3) merge sort – always O(N log N)

(4) quick sort – worst case O(N2) but on average O(N log N)

(5) heap sort – always O(N log N).