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 s = 0;
    int e = n-1;



    while(s<=e){
       int  mid = s + (e-s)/2;

        if( key == arr[mid])
            return mid;  


        if(key < arr[mid])
            e = mid-1;
        else if(key> arr[mid])
            s=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;
}

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

// int binary_search(uint8_t *arr, uint8_t n, uint8_t key){

//     return -1;
// }

// int main(){
//     uint8_t n, key;
//     scanf("%huu", &n);

//     uint8_t arr[100];

//     for(uint8_t i =0; i<n;i++){
//         scanf("%huu",&arr[i]);
//     }

//     scanf("%huu",&key);

//     int index = binary_search(arr,n,key);
//     printf("%d",index);

//     return 0;
// }

Solving Approach