Searching Methods

/* Title: Searching Method
Problem Statement:
Write a program to implement binary search
*/

#include

int i, n, key, a[20], b[20], flag =1, ch;

void bin();
void seq();
void main()

{
clrscr();
printf("\nEnter no. of elements in array : ");
scanf("%d", &n);
printf("\nEnter array elements: \n");
for(i=0; ia[j])
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}

printf("\nSorted elements are :");
for(j=0; jkey)
upp = mid - 1;
else if(key == a[mid])
{
flag = 1;
break;
}

}
if(flag == 1)
printf("\nElement found at location %d" , mid+1);
else
printf("\nElement not found");

}