Binary Search in Sorted Array

Code

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

int binary_search(uint8_t *arr, uint8_t n, uint8_t key) {
    // Your logic here
    if (n < 1) {
        return -1;
    }

    uint8_t l = 0;
    uint8_t r = n - 1;

    while (l <= r) {
        uint8_t m = l + (((r - l))/ 2);
        if (arr[m] == key) {
            return m; 
        } else if (arr[m] > key) {
            if (m > 0) {
                r = m - 1;
            } else {
                return -1;
            }
        } else {
            if (m < 255) {
                l = m + 1;
            } else {
                return -1;
            }
        }
    }
    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;
}

Solving Approach