Ìîäóëü: Ðàñ÷åò àñèìïòîòè÷åñêîé ñëîæíîñòè

for (int i = 0; i < n - 1; i++)
            for (int j = n - 2; j >= i; j--)
            {
                if (A[j] > A[j + 1])
                {
                    int c = A[j];
                    A[j] = A[j + 1];
                    A[j + 1] = c;
                    count++;
                }
            }

for i in range( n - 1 ):
    for j in range(n - 2, i - 1, -1):
        if (A[j] > A[j + 1]):
            c = A[j]
            A[j] = A[j + 1]
            A[j + 1] = c
            count += 1