Insertion Sort - rFronteddu/general_wiki GitHub Wiki
- Insertion sort compares values in turn, starting with the second value in the list.
- If this value is greater than the value to the left of it, no changes are made.
- Otherwise this value is repeatedly moved left until it meets a value that is less than it.
- The sort process then starts again with the next value.
