折半查找Binary_Search

#include <stdio.h>
#include <conio.h>


int BinarySearch(int data[], int length, int key)
{
int flag = -1;
int low = 0, high = length - 1;
while(low <= high)
{
int middle = (low + high) / 2;
if (data[middle] > key)
{
high = middle - 1;
}
else if (data[middle] < key)
{
low = middle + 1;
}
else
{
flag = middle;
break;
}


}
printf("low:%d high:%d\n", low,high);
return flag;
}


int main()
{
int data[10] = {2,4,6,6,54,234,654,6334,6643,54444};
int key = 0;
scanf("%d",&key);
int location = BinarySearch(data, 10, key);
printf("%d\n", location);
getch();
return 0;


}