#include <stdio.h>
#include <conio.h>
int BinarySearch(int *array, int noe,int key)
{
int low = 0, high = noe-1, mid;
while(low <= high)
{
mid = (low + high)/2;
if(array[mid] < key)
{
low = mid + 1;
}
else if(array[mid] == key)
{
return mid;
}
else if(array[mid] > key)
{
high = mid-1;
}
}
return -1;
}
int main()
{
int noe;
scanf("%d",&noe);
int array[noe];
int i;
for(i=1;i< noe;i++)
{
if(array[iter]< array[iter - 1])
{
printf("Given input is \n not sorted\n");
return 0;
}
}
int key;
scanf("%d",&key);
int index;
index = BinarySearch(array,noe,key);
if(index==-1)
{
printf("Element not found\n");
}
else
{
printf("Element is at index %d\n ",index);
}
return 0;
}