冒泡排序

#include <iostream>
using namespace std;

int main(int argc, const char * argv[]) {

    
    int a[] = {2,645,23,4,45,78};
    int len = sizeof(a) / sizeof(a[0]);
    
    cout << "排序前:";
    for (int i = 0; i< len; i++) {
        cout << a[i] << "\t";
    }
    cout << endl;
    

    /**
     *
     * 如果符合条件，冒泡排序的内层循环则执行交换操作。外层循环只是重复len-1次内层循环。
     * 
     * 升序和降序只有 < > 比较符号的不同
     */


    // 升序
    for (int i =0 ; i < len -1; i++) {
        for (int j = 0; j < len-1; j++) {
            if (a[j] > a[j+1]) {
                int temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
            }
        }
    }
    
    
    // 降序
    for (int i =0 ; i < len -1; i++) {
        for (int j = 0; j < len-1; j++) {
            if (a[j] < a[j+1]) {
                int temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
            }
        }
    }
    

    cout << "排序后:";
    for (int i = 0; i< len; i++) {
        cout << a[i] << "\t";
    }
    cout << endl;
        
    return 0;
}