Answer Posted / rahul awasthi
Answer
# 1 #include<conio.h>
#include<iostream.h>
#include<process.h>
int binarysearch(int list[], int end, int target, int &locn)
{
int first=0, mid, last=end;
while(first<=last)
{
mid=(first+last)/2;
if(target>list[mid])
first=mid+1;
else if(target<list[mid])
last=mid-1;
else
break;
}
locn=mid+1;
return(target==list[mid]);
}
void main()
{
int a[10],i,s=0,n,loc,flag=0;
clrscr();
cout<<"\n Enter the no. of element to store:\n";
cin>>n;
cout<<"Enter the Elements:\n";
for(i=0;i<n;i++)
cin>>a[i];
cout<<"\n The Elements are:\n";
for(i=0;i<n;i++)
cout<<a[i]<<"\t";
cout<<"\n Enter the Element to search:\n";
cin>>s;
if(binarysearch(a,n,s,&loc))
cout<<"\nThe element "<<s<< " is available
at location
"<<loc<<endl;
else
cout<<"\nThe element "<<s<< " is not found
in the List"<<endl;
}
Is This Answer Correct ? | 21 Yes | 20 No |
Post New Answer View All Answers
What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?
What is stack push?
What is the use of data structure?
Which is better hashmap or treemap?
Why is data structure needed?
What is frozenset?
Does treemap allow null keys?
Explain the common uses of threaded binary tree.
What is the most used data structure?
How does a hashmap work?
Describe queue operation.
What is the meaning of arraylist?
Which is better arraylist or linkedlist?
Is list an array?
Why is bubble sort stable?