107. Binary Search in Sorted Array

#include <stdio.h>
#include <stdint.h>

int binary_search(uint8_t *arr, uint8_t n, uint8_t key) {
    // Your logic here
    uint8_t l = 0, r = n-1;
    
    while(l <= r){
    uint8_t middle = l + (r - l) / 2;
    //uint8_t middle = (l/2) + (r/2) + ((r & 1) & (l & 1));
        if(key < arr[middle]){
            r = middle - 1;
        }
        else if(key > arr[middle]){
            l = middle + 1;
        }
        else return middle;
    }
    return -1;
}

int main() {
    uint8_t n, key;
    scanf("%hhu", &n);
    uint8_t arr[100];

    for (uint8_t i = 0; i < n; i++) {
        scanf("%hhu", &arr[i]);
    }
    scanf("%hhu", &key);

    int index = binary_search(arr, n, key);
    printf("%d", index);
    return 0;
}