is this code for binary search correct?
#include<stdio.h>
int main()
{
int i[10];
int j;
int x=0;
int y=9;
for(j=0;j<10;j++)
{
scanf("%d",&i[j]);
}
printf("enter a number whose index you want to find\n");
scanf("%d",&j);
while(x!=y&&x!=y-1&&y!=x-1)
{
if(i[(x+y)/2]<j)
x=(x+y)/2;
else if(i[(x+y)/2]>j)
y=(y+x)/2;
else
{
printf("at index %d",(x+y)/2);
break;
}
}
}