七大查找算法

/**
平均查找长度：ASL=(1+2+3+...+n)/n=(n+1)/2;
顺序查找：时间复杂度O(n);
**/
int SequenceSearch(int a[],int value,int n){
    for(int i=0;i<n;i++){
        if(A[i] == value){
            return i;
        }
    }
    return -1;
}

//二分查找,遍历
int BinarySearch(int a[],int value,int n){
    int low,high,mid;
    low = 0;
    high = n-1;
    while (low<high) {
        mid = (low+high)/2;
        if(a[mid] == n){
            return mid;
        }else if(a[mid] > n){
            high = mid - 1;
        }else{
            low = mid + 1;
        }
    }
    return -1;
}
//二分查找，递归版本