void bsortopt(int *tab, int n)
{
    int porownanie = 0, zamiana = 0;
    int pmin = 0, pmax = n - 1, p;
    do
    {
        p = -1;
        for (int i = pmin; i < pmax; i++)
        {
            porownanie++;
            if (tab[i] > tab[i + 1])
            {
                zamiana++;
                swap(tab[i], tab[i + 1]);
                porownanie++;
                if (p < 0) pmin = i;
                p = i;
            }
        }
        if (pmin) pmin--;
        pmax = p;
    } while (p >= 0);
    cout << "Ilosc porownan: " << porownanie << endl << "Ilosc zamian: " << zamiana << endl;
}