二分查找模板

二分查找模板

//
// Created by 29273 on 2022-03-16.
//
#include "bits/stdc++.h"

using namespace std;
int n,x;
int a[100];

int binarySearch(int x) {
    int low = 1;
    int high = n;

    while (low <= high) {
        int mid = (low + high) / 2;
        if (a[mid] == x) return mid;

        else if (a[mid] > x) {
            high = mid - 1;
        } else {
            low = mid + 1;
        }
    }
    return -1;
}

int main() {
    cin >> n >> x;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    cout << binarySearch(x) << endl;
    return 0;
}