冒泡排序和选择排序

//    int a[] = {3 , -9 , 32 , 77 , 63 , -24 , 14 , 0 , 21 , 45};

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

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

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

//                int cup = a[j];

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

//                a[j + 1] = cup;

//            }

//        }

//    }

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

//        printf(" %d " , a[i]);

//    }

//    for (int i = 0; i < 10 - 1; i++) { // 选择排序

//        int maxIndex = i;

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

//            if (a[maxIndex] < a[i]) {

//                maxIndex = i;

//            }

//            if (maxIndex != i) {

//                int cup = a[maxIndex];

//                a[maxIndex] = a[i];

//                a[i] = cup;

//            }

//        }

//    }

//    printf("\n以上是冒泡排序 , 以下是选择排序 \n");

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

//        printf(" %d " , a[i]);
//    }

//其中冒泡排序还可以更优化!

// 下片博客再讲