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;


}

Why does hashset use hashmap?

866

---

Are collections thread safe?

788

---

Can we extend an array after initialization?

990

---

How to find middle element of linked list in one pass?

882

---

How does shell sort work?

883

---

What are the 4 types of data?

928

---

What is the Insertion Sort Code?.

978

---

Is complete binary tree?

811

---

Can you list out the areas in which data structures are applied extensively?

959

---

What are the advantages of selecetion sort?

1037

---

There are 2 int type array data type. One is containing 50 elements, and another one is containing 30 elements. Can we assign the array of 50 elements to an array of 30 elements?

1202

---

When is a binary search best applied?

824

---

Explain binary tree traversals?

865

---

State the properties of b tree.

979

---

What is stable sort?

953

---