梳排序和冒泡排序

void bobboSort(int a[],int len){
    int count = 0;
    for (int i = 0; i < len; i++) {
        for(int j=i;j<len;j++){
            if(a[i] > a[j]){
                a[i] = a[i] +a[j];
                a[j] =a[i] - a[j];
                a[i] = a[i] - a[j];
            }
            count++;
        }

    }
    printf("bobbo-count:%d\n",count);

}
void sort(int a[],int len){
    int count = 0;
    printf("len:%d\n",len);

    int tmp = (int) (len * 0.8);


    while(tmp >= 1){
        for(int i=0;i<len;i++){
            count++;
            if(i + tmp < len && a[i] > a[i+tmp]){
                a[i] = a[i] + a[i+tmp];
                a[i+tmp] = a[i] - a[i+tmp];
                a[i] = a[i] - a[i+tmp];
            }else if(i+tmp >= len){
                break;
            }


        }
        tmp *=0.8;

    }
    printf("sort-count:%d\n",count);
}