void sort(int ar[], size_t n)
{
    int sp = 1;
    while (sp && n--)
    {
        sp = 0;
        for (size_t i=0; i<n; ++i)
        {
            if (ar[i+1] < ar[i])
            {
                int tmp = ar[i];
                ar[i] = ar[i+1];
                ar[i+1] = tmp;
                sp = 1;
            }
        }
    }
}