Binary Search

#include <iostream>
using namespace std;

int main() {
    int A[10], n=10, key;
    for(int i=0;i<n;i++){
        cin>>A[i];
    }
    cin>>key;
    
    int l = 0, h=n-1;
    
    while(l<=h){
        int mid = (l+h)/2;
        if(key>A[mid]){
            l = mid+1;
        }
        else if(key<A[mid]){
            h = mid-1;
        }
        else{
            cout<<"found key at "<<mid;
            return 0;
        }
    }
    
    cout<<"key not found";
    return 0;
}