Problem

Given a sorted array of integers and a target value, find the index of the target value in the array. If the target value is not present in the array, return -1.
Example input: [1, 2, 3, 4, 5], 3
Example output: 2

Solution

#include <iostream>
#include <vector>

using namespace std;

int binarySearch(vector<int>& arr, int target) {
    int left = 0;
    int right = arr.size() - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (arr[mid] == target) {
            return mid;
        } else if (arr[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    return -1;
}

int main() {
    vector<int> arr = {1, 2, 3, 4, 5};
    int target = 3;
    cout << binarySearch(arr, target) << endl;
    return 0;
}