Sort algorithms - Insertion Sort

insertionSort.cpp

#include<iostream>
using namespace std;

main()
{
    int numbers[5] = { 10,1,53,5,8 };
    int length = sizeof(numbers) / sizeof(numbers[0]);

    for (int i = 1; i < length; ++i) {
        int key = numbers[i];
        int predecessor;
        for (predecessor = i - 1; predecessor >= 0; --predecessor) {
            if (key > numbers[predecessor]) break;
            numbers[predecessor + 1] = numbers[predecessor];
        }
        if (i != predecessor + 1)
            numbers[predecessor + 1] = key;
    }
    for (const int& n : numbers) cout << n << " ";
}