Answer Posted / arnoldindia
#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 ? | 51 Yes | 23 No |
Post New Answer View All Answers
How many pointers are necessary to implement a simple linked list?
Which process places data at the back of the queue?
What is a data structure? What are the types of data structures? Briefly explain them
Why do we need algorithm?
Mention the steps to insert data at the starting of a singly linked list?
Is a hashset ordered?
Explain merge sort algorithms.
How do you implement a stack?
List the area of applications where stack data structure can be used?
What is a sorting algorithm in data structure?
What is time complexity of arrays sort?
Which sort is stable?
How to find middle element of linked list in one pass?
Can arraylist be resized?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
