#include <stdio.h>
#include <conio.h>
void sort(int s[], int n);
int bsearch(int s[], int x, int n);
main()
{
  const int n=8;
  int s[n],i,x;
  clrscr();
  printf("Enter 8 Number!\n\n");
  for(i=0;i<8;i++)
  {
    printf("\   Number[%d]=",(i+1));
    scanf("%d",&s[i]);
  }
  printf("\n\nEnter a Number For Search=");
  scanf("%d",&x);
  sort(s,n);
  if(bsearch(s,x,n)==-1)
    printf("\n\nThe Number %d Not Found!",x);
  else
    printf("\n\nThe Number %d Found!",x);
  getch();
}
void sort(int s[], int n)
{
 int i,j,k;
 for(i=0;i<n;i++)
   for(j=i+1;j<n;j++)
     if(s[i]>s[j])
     {
       k=s[i];
       s[i]=s[j];
       s[j]=k;
     }
 printf("\n\nAnswer of Sort=\n\n\t");
 for(i=0;i<8;i++)
   printf("%d\  ",s[i]);
}
int bsearch(int s[], int x, int n)
{
 int low=0,mid,high=n-1;
 while(low<=high)
 {
   mid=(low+high)/2;
   if(x<s[mid])
     high=mid-1;
   else if(x>s[mid])
     low=mid+1;
   else
     return mid;
 }
 return -1;
 }