有序序列的查找

#include "stdio.h"
#include
#define MAX 100
using namespace std;
int Binary_Search(const int* array, int n, int key)
{
    int low = 1;
    int high = n;
    int mid;
    while (low  array[mid])
                high = mid - 1;
            else if (key