排序算法(1)-冒泡排序

// 冒泡排序
void bubbleSort(int *a,int length) {
    int temple ; // 定義臨時變量
    for (int i = 0; i<length-1; i++) {
        for (int j = 0; j < length -i-1; j++) {
            if (a[j] > a[j+1]) {
                temple = a[j+1];
                a[j+1] = a[j];
                a[j] = temple;
            }
        }
        for (int i = 0 ; i< length ; i++) {
            printf("%d ",a[i]);
        }
        printf("\n");

    }
}