simple_binary_search.c

#include <stdio.h>
int main()
{
    int i, count = 0, low, high, mid, n, key, array[100];
    scanf("%d",&n);
    for(i = 0; i < n; i++)
        scanf("%d",&array[i]);
    scanf("%d", &key);
    low = 0;
    high = n - 1;
    mid = (low+high)/2;
    while (low <= high) {
        count++;
        if(array[mid] < key) {
            low = mid + 1;
        }
        else if (array[mid] == key) {
            printf("%d %d", mid+1, count);
            break;
        }
        else
            high = mid - 1;
        mid = (low + high)/2;
    }
    if(low > high) {
        printf("-1");
    }
    return 0;
}