Binary Search in Sorted Array

Code

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


int binary_search(uint8_t *arr, uint8_t n, uint8_t target) {
    // Your logic here
    short head=0,tail=n-1;
    

    while(head<=tail){
    short key=head+(tail-head)/2;
    if(arr[key]==target) return key;
    else if(arr[key]<target)
     {
        head=key+1;
     }else if(arr[key]>target)
    {
        tail=key-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