COMP0005-Notes(2): Selection sort & Insertion sort

Selection Sort

Main Idea

• Scan the array from the left to the right of the array;
• n iterations;
• in each iteration i (0 <= i <= n-1), find the index min of the smallest entry in the remaining part of the array - elements stored on the “right-hand-side”/after a[i];
• swap a[i] and a[min].

Invariants

1. Elements from index 0 up to index i (in other words, to the left of i) are sorted;
2. No element from index i up to the last element is smaller than any element to the left of i(otherwise they would have been the minelement!).

Complexity

Insertion Sort

Main Idea

• Again, scan from left to right;
• n iterations;
• in each iteration i (0 <= i <= n-1), insert elementa[i] into the correct position in the elements to its left, by continuously comparing and swapping between elements in the reverse order.

Invariants

1. Elements from index 0 up to index i are sorted, However, the order is NOT the final order, as in each iteration, we have never cared about the elements to the right of i!

Complexity