DATA STRUCTURE...CoDinG!!@#@$@!%$%binarySearching

today we study about data struct or coding..
searching have 2 types : sequence and binary..
this example for algorithm searching:::

#include<stdio.h>

void binarySearching(int data[]);
void main()
{
int data[]={1,2,3,4,5,6,7,8,9};
binarySearching(data);
}
void binarySearching(int data[])
{
int start=0;
int end=9;
int status=0;
int n,middle;

printf("\n\nInteger to search: ");
scanf("%d",&n);
printf("\n\t Index\tData");
while((status!=1)&&(start<=end))
{
middle=(start+end)/2;
printf("\n\t %d\t%d", middle,data[middle]);
if(n==data[middle])
status=1;
else if(n<data[middle])
end=middle-1;
else
start=middle+1;
}
if(status!=1)
printf("\n\tData not found");
}