Program 114:Binary Search with input as sorted order

Program 114:
 

#include<stdio.h>
main()
{
 int i,n,searchno,low,mid,high,flag=0;
 printf("Enter size of array\n");
 scanf("%d",&n);
 int a[n-1];
    printf("Enter the numbers in sorted order\n");
    for(i=0;i<n;i++)
    {
     scanf("%d",&a[i]);
    }
    
    printf("Enter the element to be searched\n");
    scanf("%d",&searchno);

    low=1;
    high=n;
    
 do
    {
     mid=(high+low)/2;
     if(searchno<a[mid])
     {
      high=mid-1;
      flag=0;
     }
    else if(searchno>a[mid])
     {
      low=mid+1;
      flag=0;
     }
     else
     {
      flag=1;
      break;
     }
      }while(searchno!=a[mid]&&low<=high);
    
    if(flag==1)
    {
     printf("Search Successful\n");
    }
    else
    {
     printf("Search is not Successful\n");
    }
    
}

Explanation:

//Coming Soon...

 Output: