sortShakeNew

#include <iostream>


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

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

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

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

        for (int intHead = 0; intHead < tail; ++intHead)
        {
            if (arr[intHead] > arr[intHead+1])
            {
                int tmp = arr[intHead];
                arr[intHead] = arr[intHead + 1];
                arr[intHead + 1] = tmp;

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

    }

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