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
    bool direct =0;
    int start =0;
    int end =n-1;

   while(start <= end)
   {
    int mid = start + (end - start) /2;

    if(arr[mid] == key)
    return mid;
    else if (arr[mid] < key)
    start = mid+1;
    else
    end =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;
}

Solving Approach