Thread: help me !

Code:

      

#include<stdio.h>
      #include<conio.h>
      void main()
      {
      int a[100],temp,x,n,l,r,mid,c,i,j;
      clrscr();
      printf("enter the size");
      scanf("%d",&n);
      printf("enter the values");
      for(i=0;i<n;i++)
      {
      scanf("%d",&a[i]);
      }
      printf("enter the value to searched");
      scanf("%d",&x);
      printf("enter ur choice 1.linaer 2.binary 3.exit\n");
      scanf("%d",&c);
      switch(c)
      {
      case 1:

      for(i=0;i<n;i++)
      {
      if(a[i]==x)
      {
      printf("element is found at %d",i+1);
      }
      }
      break;
      case 2:
      for(i=0;i<n;i++)
      {
      for(j=0;j<n;j++)
      {
      if(a[i]<a[j])
      {
      temp=a[i];
      a[i]=a[j];
      a[j]=temp;
      }
      }
      }
      printf("sorted array ");
      for(i=0;i<n;i++)
      {
      printf("\t%d\t",a[i]);
      }
      mid=(l+r)/2;
      while(a[mid]!=x && l<r)
      {
      if(x>a[mid])
      {
      l=mid+1;
      }
      else
      {
      r=mid-1;
      }
      mid=(l+r)/2;
      if(l>=r)
      {
      printf("element not found");
      }
      else
      {
      printf("element found at %d",mid+1);
      }
      }
      break;
      case 3:
      exit(0);
      break;
      default:
      printf("invalid");
      break;
      }
      getch();
      }

this is a binary search program ,,,,plz make correction in this program do not offer me another binary search progg. and suggest me debugging steps and also explain my fault....it is executing upto "array sorting" efficiently but not after that i.e binary search part !!