Binary Search in C Language

#include<stdio.h>

#include<conio.h>

void main()

{

int  no, arr[20], search, mid, l=0, r, i, j, temp;

clrscr();

printf("how many element you want to enter: ");

scanf("%d",&no);

printf("\nenter element one by one:\n");

for(i=0; i<no; i++)

{

printf("%d element: ",i+1);

scanf("%d",&arr[i]);

}

for(i=0; i<no-1; i++)

{

for(j=0; j<no-1; j++)

{

if(arr[j] > arr[j+1)

{

temp = arr[j];

arr[j] = arr[j+1];

arr[j+1] = temp;

}

}

}

printf("\nyour element set in assending order: ");

for(i=0; i<no; i++)

{

printf("\n%d element: %d",i+1,arr[i]);

}

printf("\n\nsearch element: ");

scanf("%d",&search);

r=no-1;

while(l <= r)

{

mid = (l + r) / 2;

if(search == arr[mid])

{

printf("\n%d element at %d position",search,mid+1);

break;

}

else if(search < arr[mid])

{

r = mid-1;

}

else

{

l = mid+1;

}

}

if(l > r)

{

printf("\n%d element is not found",search);

}

getch();

}