void sort(int values[], int n)
{
    int j = 0;
    do
    {
        int sorted=0;
        int i = 0;
        do
        {

            if(values[i] > values[i + 1])
            {
                int* ptr1 = &values[i];
                int* ptr2 = &values[i + 1];
                values[i] = *ptr2;
                values[i + 1] = *ptr1;
                i++;
            }
            else
            {
                i++;
                sorted++;// count sorted positions
            }
        }
        while( i < n - j - 1);

        if(sorted == i) // check if sorted positions are equal to all positions, if true end program
        {
            return;
        }
        j++;
     }
     while(j > (n*(n-1)/2));
    return;
}