数据结构和算法

冒泡排序:

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

二分查找:

int binary_search(int a[],int len,int goal){
    int low = 0;
    int high = len - 1;
    while (low <= high) {
        int mid = (low + high)/2;
        if (goal==a[mid]) {
            return mid;
        }else if(goal<a[mid]){
            high = mid-1;
        }else{
            low = mid+1;
        }
    }
    return -1;
}