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
    int l=0;
    int h=n-1;

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