//二分查找(折半查找)
int Bindary_Search(int *a, int n, int key) //第一版本
{
int low, high, mid;
low = 1;
high = n;
while (low <= high)
{
mid = low + (high - low) / 2; //折半 最重要!
if (a[mid] > key)
{
high = mid - 1;
}
else if(a[mid] < key)
{
int Bindary_Search(int *a, int n, int key) //第一版本
{
int low, high, mid;
low = 1;
high = n;
while (low <= high)
{
mid = low + (high - low) / 2; //折半 最重要!
if (a[mid] > key)
{
high = mid - 1;
}
else if(a[mid] < key)
{