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 left_index = 0, right_index = n - 1;
    while (left_index <= right_index) 
    {
        int mid = left_index + (right_index - left_index) / 2;
        if (arr[mid] == key) 
        {
            return mid;
        } 
        else if (arr[mid] < key) 
        {
            left_index = mid + 1;
        } 
        else 
        {
            right_index = mid - 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;
}