冒泡排序

void bubbleSort(int array[], int n) {
    int lastElement;
    for (lastElement = n-1; lastElement > 0; --lastElement) {
        int i, flag = 0;
        for (i = 0; i < lastElement; ++i) {
            if (array[i] > array[i+1]) {
                swap(&array[i], &array[i+1]);
                flag = 1;
            }
        }
        //若flag=0，则没有发生交换，已经有序
        if (flag == 0) {
            break;
        }
    }
}