Binary Search using iteration

#include <iostream>
using namespace std;

int main() {
    
    int arr[] = {1,2,3,4,5,6,7,8,9,10};
    int val = 2;
    
    int l = 0;
    int h = 9;
    
    int flag = false;
    
    while(l<=h){
        
        int mid = (l+h)/2;
        if(arr[mid] == val){
            flag = true;
            cout<<mid;
            break;
        }else if(arr[mid]>val){
            h = mid-1;
        }else if(arr[mid]<val){
            l=mid+1;
        }
        
    }
    
    if(flag == false){
        cout<<"Not Present in the given array";
    }
}