Binary Search in Sorted Array

Code

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

int binary_search(uint8_t *arr, uint8_t n, uint8_t key) {
    // Your logic here
    uint8_t midpoint, low = 0, top = n-1;
    while(low <= top)
    {
        midpoint = (top + low)/2;
        if(arr[midpoint]==key)
            return midpoint;
        else if(arr[midpoint] < key)
            low = midpoint + 1;
        else if(arr[midpoint] > key)
            top = midpoint - 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