#include <conio.h>
#include <stdio.h>

void main()
{
   int i,j,tmp, first, last, middle, n, val, num[100];
   clrscr();
   printf("Enter number of elementsn");
   scanf("%d",&n);
   printf("Enter %d integersn", n);
   for ( i = 0 ; i < n ; i++ )
      scanf("%d",&num[i]);
   for(i=0;i<n;i++)
   {
 for(j=i+1;j<n;j++)
 {
  if(num[i]>num[j])
  {
   tmp=num[i];
   num[i]=num[j];
   num[j]=tmp;
  }
 }
   }
   clrscr();
   printf("nSorted array is:n");
   for(i=0;i<n;i++)
   {
 printf("%dt",num[i]);
   }
   printf("nnEnter value to searchn");
   scanf("%d",&val);
   first = 0;
   last = n - 1;
   middle = (first+last)/2;
   while( first <= last )
   {
      if ( num[middle] < val )
  first = middle + 1;
      else if ( num[middle] == val )
      {
  printf("%d found at position %d.n", val, middle+1);
  break;
      }
      else
  last = middle - 1;
      middle = (first + last)/2;
   }
   if ( first > last )
      printf("Not found! %d is not present in the list.n", val);
   getch();
}