Sort algorithms - Selection Sort

selectionSort.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 = 0; i < length; ++i) {
        int minValueIndex = i;

        for (int j = i; j < length; ++j)
            if (numbers[j] < numbers[minValueIndex]) minValueIndex = j;

        if (i != minValueIndex) {
            int temp = numbers[i];
            numbers[i] = numbers[minValueIndex];
            numbers[minValueIndex] = temp;
        }
    }

    for (const int& n : numbers) cout << n << " ";
}