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;


}

What is precision?

926

---

How remove all from arraylist?

879

---

How are elements stored in hashset?

895

---

What is the difference between hashset and linkedhashset?

936

---

What is time complexity of bubble sort?

827

---

Which is faster hashset or treeset?

948

---

Differentiate between list and map.

969

---

Define binary tree insertion.

907

---

What is sorted map?

842

---

What is 2 dimensional linked list?

957

---

What is the difference between collections class vs collections interface?

907

---

List out the applications of a linked list?

838

---

Differentiate between set and map.

1052

---

Difference between arrays and linked list?

889

---

How do I start preparing for placement?

992

---