Binary Search in Sorted Array

Code

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

int binary_search(uint8_t *arr, uint8_t n, uint8_t key) {
    int low = 0;
    int high = n-1;
    int middle = 0;

    while(low <= high){
        middle = (low + high)/2;
        if(*(arr + middle) == key) return middle;
        else if(*(arr + middle) < key) low = middle + 1;
        else if(*(arr + middle) > key) high = middle - 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