【排序-冒泡排序】

#include 

using namespace std;

template 
void BullleSort(T *src, int size) {
    for (int i = 0; i < size - 1; i++) {
        for (int j = 0; j < size - 1 - i; j++) {
            if (src[j] > src[j + 1]) {
                T temp = src[j];
                src[j] = src[j + 1];
                src[j + 1] = temp;
            }
        }
    }
}

int main () {
    char c_arr[10] = {'a','c','e','h','g','b','i','j','d','f'} ;
    BullleSort(c_arr,sizeof(c_arr)/sizeof(c_arr[0]));
    for (int i = 0; i < 10; i++) {
        cout << c_arr[i] << " ";
    }
    cout << endl;

    int i_arr[10] = {0,2,3,6,8,9,4,5,7,1};
    BullleSort(i_arr,sizeof(i_arr) / sizeof(i_arr[0]));
    for (int i = 0; i < 10; i++) {
        cout << i_arr[i] << " ";
    }
    cout << endl;

    return 0;
}