binary search (C++)

#include<iostream>

using namespace std;



int binary_search(int arr[], int size, int target){
    int left = 0;
    int right = size - 1;
    while (left <= right){
        int mid = (left + right) / 2;

        if (arr[mid] == target)
            return mid;

        if (arr[mid] < target)
            left = mid + 1;
        else
            right = mid - 1;
    }
    return -1;
}


int main(){
    int arr[] = {1,3,5,6,7,9,11,14,16,17,10,33};
    int target = 14;

    int size = sizeof(arr) / sizeof(arr[0]);

    int result = binary_search(arr, size, target);
    
    cout << result;

    return 0;
}