二分查找排序

代码：

int sequenceSearchV0(int *arr, int value, int size){
    for(int i = 0; i < size; i++){
        if(*(arr + i) == value){
            return i;
        }
    }
    return -1;
}

int sequenceSearchV1(int *arr, int value, int size){
    int tmp = -1;
    for(int i = 0; i < size; i++){
        if(*(arr + i) == value){
            tmp = i;
        }
    }
    return tmp;
}

int sequenceSearchV2(int arr[], int value){
    int size = sizeof(arr)/sizeof(arr[0]);
    int tmp = -1;
    for(int i = 0; i < size; i++){
        if(*(arr + i) == value){
            tmp = i;
        }
    }
    return tmp;
}

int binarySearch(int arr[], int valule){
    int tmp = -1;
    int size = sizeof(arr)/sizeof(arr[0]);//11
    int low = 0;
    int high = size - 1;
    int mid = 0;    
    while(low <= high){
        mid = (low + high)/2
        if(arr[mid] == value){
            tmp = mid;
        }
        if(arr[mid] > value){
            high = mid - 1;
        }
        if(arr[mid] < value){
            low = mid + 1;
        }
    }
    return tmp;
}
int main(int argc, char **argv)
{
    int arr[] = {0,16,24,35, 44, 47,59,62,73,88,99};
    int key=100;
    int index=binarySearch(arr,key);
    printf("%d is located at: %d\n", key, index);    
    return 0;
}