alg_effective shackerSort(int* arr, size_t size)
{
    alg_effective alg_eff;

    for (size_t i = 0; i < size - 1; i++)
    {
        alg_eff.C++;

        if (arr[i] > arr[i + 1])
        {
            std::swap(arr[i], arr[i + 1]);
            alg_eff.M++;

            for (int k = i; (arr[k] < arr[k - 1]) && (k >= 1); k--)
            {
                std::swap(arr[k], arr[k - 1]);
                alg_eff.M++;
                alg_eff.C++;
            }
        }
    }

    return alg_eff;
}