/*Binary Search*/
#include<iostream.h>
#include<conio.h>
int x[20],s;
int search(int lb,int ub)
{
int mid;
if(ub<lb)return 0;
mid=(lb+ub)/2;
if(s==x[mid])return mid;
else if(s<x[mid])search(lb,mid-1);
else search(mid+1,ub);
}
void main()
{
int i,j;
cout<<"Enter Size";
cin>>j;
cout<<"Enter element";
for(i=1;i<=j;i++)
cin>>x[i];
cout<<"Enter Element";
cin>>s;
cout<<"Position"<<search(1,j);
getch();
}
#include<iostream.h>
#include<conio.h>
int x[20],s;
int search(int lb,int ub)
{
int mid;
if(ub<lb)return 0;
mid=(lb+ub)/2;
if(s==x[mid])return mid;
else if(s<x[mid])search(lb,mid-1);
else search(mid+1,ub);
}
void main()
{
int i,j;
cout<<"Enter Size";
cin>>j;
cout<<"Enter element";
for(i=1;i<=j;i++)
cin>>x[i];
cout<<"Enter Element";
cin>>s;
cout<<"Position"<<search(1,j);
getch();
}
No comments:
Post a Comment