冒泡算法的改进

void bubbleSort(int *array, int capacity)
{
    int last = capacity;
    int j, tmp;
    while (0 < last)
    {
        tmp = last;
        for (last = j = 0; j < tmp; j++)
        {
            if (array[j] > array[j + 1])
            {
                array[j] ^= array[j + 1];
                array[j + 1] ^= array[j];
                array[j] ^= array[j + 1];

                last = j;
            }
        }
    }
}