Binary search realization in C (simplest and probably fastest)

binary-search.c

#include <math.h>
#include <stdbool.h>

bool binarySearch(int value, int values[], int n)
{
    // Memorize the offset of a half rather then create an array on each iteration
    int offset = 0;
    int divider = n;
    while (divider > 0) {
        divider = round((divider + 1) / 2); // round up
        
        if (values[offset + divider] <= value) {
            if (offset + divider < n) {
                offset += divider;
            }
        }
        
        if (values[offset] == value) return true;
    }
    
    return false;
}