优化冒泡排序

//    int a[10] = {0};

//    BOOL needAgin = YES;       //先初始化还要继续排序

//    for (int i = 0; i < 10; i++) {

//        a[i] = arc4random() % 10;// 随机赋值

//    }

//    for (int i = 0; i < 10 - 1 && needAgin == YES; i++) {

//        needAgin = NO;//     假设不用继续排序

//        for (int j = 0; j < 10 - 1 - i; j++) {

//            if (a[j] > a[j + 1]) {

//                needAgin = YES;// 如果进入到这里 说明 还需要继续排序

//                int cup = a[j];

//                a[j] = a[j + 1];

//                a[j + 1] = cup;

//            }

//        }

//    }

//    for (int j = 0; j < 10; j++) {

//        printf("%d\t" , a[j]);

//    }