Binary Search: Determine if Target Value Exists in Sorted Array

Problem

Given a sorted array of integers and a target value, determine if the target value exists in the array.
Example input:
nums = [1, 2, 3, 4, 5]
target = 3
Example output:
True

Solution

This solution is in C++. Our A.I. can create solutions in multiple languages.

kayakane

#include <iostream>
#include <vector>

using namespace std;

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

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