#include "binary_search.h"

const int *binary_search(int value, const int *arr, size_t length) {
    size_t left = 0, right = length;
    while (left < right) {
        size_t mid = left + (right - left) / 2;

        if (arr[mid] < value)
            left = mid + 1;
        else if (arr[mid] > value)
            right = mid;
        else
            return &arr[mid];
    }
    return NULL;
}