Sort algorithms - Bubble Sort

bubbleSort.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)
        for (int j = i + 1; j < length; ++j)
            if (numbers[i] > numbers[j]) {
                int temp = numbers[i];
                numbers[i] = numbers[j];
                numbers[j] = temp;
            }

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