冒泡排序较优解

#include <stdio.h>

void swap(int *a,int *b);
int main(int argc, const char * argv[]) {
    
    int a[6] = {1,6,8,1,6,8};
    int length = sizeof(a)/sizeof(a[0]);
    _Bool flag = 1;
    
    for (int i=1; i<length && flag; i++) {
        
        flag = 0;
        for (int j=length-1; j>=i; j--) {
            if (a[j-1]>a[j]) {
                swap(&a[j-1], &a[j]);
                flag = 1;
            }
        }
    }
    
    for (int i = 0; i<length; i++) {
        printf("%d\t",a[i]);
    }
    printf("\n");
    return 0;
}

void swap(int *a,int *b){
    int temp = *a;
    *a = *b;
    *b = temp;
}