假期简单算法--折半查找

/*
    折半查找：目标队列关键字有序，必须是顺序存储结构
*/

#include <iostream>
const int NOT_FOUND = -1;
int binSearch(int Array[],int start,int end,int key){
    int left,right;
    int mid;
    left = start;
    right = end;
    while(left<=right){
        mid = (left+right)/2;
        if(key == Array[mid]){
            return mid;
        }else if(key<Array[mid]){
            right = mid - 1;
        }else if(key>Array[mid]){
            left = mid + 1;
        }
    }
    return NOT_FOUND;
}
int main(void){

    int Array[10] = {0,1,2,3,4,5,6,7,8,9};
    int result = binSearch(Array,0,9,2);
    std::cout<< "result = " << result << std::endl;
    return 0;

}