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
    int index_left = 0;
    int index_right = n-1;
    int index_mid;

    while(index_left <= index_right)
    {
        index_mid = index_left + ((index_right-index_left)>>1);
        if(key > arr[index_mid])
        {
            //Look right side
            index_left = index_mid+1;
        }
        else if(key < arr[index_mid])
        {
            //Look left side
            index_right = index_mid-1;        
        }
        else
        {
            // Matched
            return index_mid;
        }
    }

    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