Binary Search in Sorted Array

Code

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

int binary_search(uint8_t *arr, uint8_t n, uint8_t key) {
    uint8_t s=0;
    uint8_t e=n;
    uint8_t m=0;

    while(s<e){
        m=(s+e)/2;
        if(key==arr[m]){
            return m;
        }
       else if(key>arr[m]){
            s=m+1;
        }
        else {
            e=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