Binary Search

#include<stdio.h>


void main()
{
    int key,low=0,high,a[100],n,i,mid;

    printf("Enter number of elements\n");
    scanf("%d",&n);

    printf("enter elements in an array\n");

    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    printf("Enter key\n");
    scanf("%d",&key);

    high=n-1;

    while(low<=high)
    {
        mid=(low+high)/2;

        if(key==a[mid])
        {

            printf("Element is found at position %d\n",mid+1);
            break;
        }

        else if(a[mid]>key)

            high=mid-1;
        else
            low=mid+1;
    }

    if(low>high)
        printf("element not found\n");
}
OUTPUT
Enter number of elements
5
enter elements in an array
1
2
3
4
5
Enter key
4
Element is found at position 4
Enter number of elements
3
enter elements in an array
1
2
3
Enter key
5
element not found