Binary Search in Sorted Array

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

int find(uint8_t *arr,uint8_t start, uint8_t end,uint8_t n,uint8_t key){
    if(start>end){
        return -1;
    }
   int  mid=(start+end)/2;
    if(arr[mid]==key){
        return mid;
    }
    else if(key>arr[mid]){
        return find(arr,mid+1,end,n,key);
    }
    else if(key<arr[mid]){
       return find(arr,start,mid-1,n,key);
    }
  
}
int binary_search(uint8_t *arr, uint8_t n, uint8_t key) {
    // Your logic here
     return find(arr,0,n,n,key);

}

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;
}