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
    uint8_t l = 0;
    uint8_t r = n-1;

    while( l <= r){
        uint8_t m = (l + r) / 2;
        uint8_t val = arr[m];

        if(key == val){
          return m;
        }
        else if(val < key){
            l = m + 1;
        }
        else{
            r = m - 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