void HalfSearch(){    int a[10] = {1,2,3,4,5,6,7,8,9,10 };    int mid;    int High = 9;    int Low = 0;    int key;    cout << "请输入key" << endl;    cin >> key;    int Conut = 5;    while (Conut != 0)    {        mid = (High + Low) / 2;        if (key == a[mid])        {            cout << "在数组中的位置为:" << mid << endl;            exit(0);        }        else if (key > a[mid])        {            Low = mid + 1;        }        else if (key < a[mid])        {            High = mid - 1;        }        Conut--;    }    cout << "未找到" << endl;}