cppBubleSortPermutationOptimization

#include <iostream>

int main()
{
    const int arrSize{ 10 };
    //int arr[arrSize]{ 6,1,4,2,8,9,11,3,2,1 };
    int tmp;
    int iter{ 0 };
    int permutation{ 0 };

    //int arr[arrSize]{ 1,2,3,4,5,6,7,8,9,10 };
    //int arr[arrSize]{};
    int arr[arrSize]{ 1,1,2,9,3,4,6,9,5,11 };
    for (int i{ 0 }; i < arrSize; ++i) { std::cout << arr[i] << ' '; } std::cout << '\n';

    for (int head{ 0 }; head < arrSize; ++head)
    {
        permutation = 0;
        for (int tail{ arrSize - 1 }; tail > head; --tail, ++iter)
        {
            if (arr[tail] < arr[tail - 1])
            {
                tmp = arr[tail];
                arr[tail] = arr[tail - 1];
                arr[tail - 1] = tmp;
                ++permutation;

                for (int i{ 0 }; i < arrSize; ++i) { std::cout << arr[i] << ' '; } std::cout << '\n';
            }
        }
        if (permutation == 0) { std::cout << "Array already sorted!\n"; break; }
    }

    for (int i{ 0 }; i < arrSize; ++i) { std::cout << arr[i] << ' '; } std::cout << '\n';
    std::cout << "Total iteration " << iter << '\n';
    return 0;
}