sortShakeOptimal

#include <iostream>

using namespace std;
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++) { cout << arr[i] << " "; }    cout << endl;
    for (int head = 0, tail=arrSize-1; head < tail; head++, tail--)
    {
        int  changes=0;
        for (int intTail = tail; intTail > head; intTail--)
        {
            cout << "tailER head:" << head << endl;
            if (arr[intTail] < arr[head])
            {
                int tmp = arr[intTail];
                arr[intTail] = arr[head];
                arr[head] = tmp;
                changes++;
                for (int i = 0; i < arrSize; i++) { cout << arr[i] << " "; } cout << "tailER head:" << head << endl;
            }
        }

        for (int intHead = head; intHead < tail; intHead++)
        {
            cout << "headER tail:"<< tail << endl;
            if (arr[intHead] > arr[tail])
            {
                int tmp = arr[intHead];
                arr[intHead] = arr[tail];
                arr[tail] = tmp;
                changes++;
                for (int i = 0; i < arrSize; i++) { cout << arr[i] << " "; } cout << "headER tail:"<< tail << endl;
            }
        }
        if(!changes){cout << "No more changes!\n" << endl; break;};
    }

    for (int i = 0; i < arrSize; i++) { cout << arr[i] << " "; }    cout << endl;
}