Binary Search.c

// BINARY SEARCH
#include <stdio.h>
int BinarySearch(int array[], int length, int key)
{
    int high = length - 1;
    int low = 0;
    if (low <= high)
    {
        while (low <= high)
        {
            int mid = (low + high) / 2;

            if (key == array[mid])
            {
                return mid;
            }
            else if (key < array[mid])
            {
                high = mid - 1;
            }
            else
            {
                low = mid + 1;
            }
        }
    }

    return -1;
}
int main()
{
    int n, i, item;
    printf("\nEnter the no of array elements: ");
    scanf("%d", &n);
    int a[n];
    printf("\nEnter the array elements: ");
    for (i = 0; i < n; i++)
        scanf("%d", &a[i]);
    printf("\nEnter the item to be searched: ");
    scanf("%d", &item);

    int result = BinarySearch(a, n, item);
    if (result == -1)
    {
        printf("\nElement is not present in the array\n");
    }
    else
    {
        printf("\nElement is found at index: %d\n", result);
    }
    return 0;
}