Binary Search

#include<stdio.h>
int main()
{
    int arr[8], i, l=0, r=7, mid, key, f=0;

    for(i=0; i<8; i++)
    {
        scanf("%d", &arr[i]);
    }

    printf("Given Key: ");
    scanf("%d", &key);

    for(i=0; i<8; i++)
    {

        while(l<=r)
        {
            mid=(l+r)/2;

            if(arr[mid]==key)
            {
                printf("%d at found %d\n", key, i+1);
                f=1;
                break;
            }

            else if(arr[mid]>key)
            {
                r=mid-1;
            }
            else if(arr[mid]<key)
            {
                l=mid+1;
            }

        }
    }
    if(f==0)
    {
        printf("Not Found\n");
    }
    return 0;
}