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;


}

What are the tasks performed during inorder traversal?

968

---

What is the use of bubble sort?

873

---

How do I push an element into a stack?

868

---

On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.

973

---

Can arraylist hold duplicates?

920

---

Can arraylist store primitives?

934

---

Write a Program for Linked list manipulation.

1033

---

What is the difference between hashset and linkedhashset?

1007

---

Why do we use sorting?

867

---

What is bubble sort used for?

815

---

Does hashmap allow duplicate keys?

1008

---

Define an algorithm. What are the properties of an algorithm?

1062

---

What is the Difference between treemap and hashmap?

991

---

List the area of applications where stack data structure can be used?

917

---

Describe the complexity of Quick Sort

933

---