9. Write a program to implement binary search.

    #include <stdio.h>
    #include <conio.h>
    void main()
    {
        int a[10], n, i, beg = 0, end, mid, flag = 0, item;
        clrscr();
        printf("Enter the no. of the elements in the array: ");
        scanf("%d", &n);
        for (i = 0; i < n; i++)
        {
            printf("Enter %d elements: ", i + 1);
            scanf("%d", &a[i]);
        }
        printf("Enter the item for searching: ");
        scanf("%d", &item);

        end = n;
        while (beg <= end)
        {
            mid = (beg + end) / 2;
            if (item == a[mid])
            {
                flag = 1;
                break;
            }
            if (item > a[mid])
                beg = mid + 1;
            else
                end = mid - 1;
        }
        if (flag == 1)
            printf("%d element at position %d", item, mid + 1);
        else
            printf("%d element is not found");
    }