int bubble_inverson2_sort(int *arr, int length) {
    int k = 2; //n
    int n = length - 1;

    int t;

    int counter = 0;
    do {
        k++; //t
        t = 0;

        k += 3 * n + 2; //for
        for (int i = 0; i < n; i++) {

            k += 4; //if
            if (arr[i] > arr[i + 1]) {
                k += 2; //myswap args
                myswap(arr[i], arr[i + 1], k);

                k++; //t
                t = i;
            }
        }
        k++; //n;
        n = t;

        k++; //do-while
    } while (t != 0);


    return k;
}