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;


}

Run time memory allocation is known as ?

988

---

What are two types of sorting?

998

---

Does treemap allow null values?

847

---

What is entryset in hashmap?

898

---

What is two-dimensional array?

939

---

What are the advantages of data structure?

951

---

What is Another name of Dynamically allocating memory.

972

---

What do you understand by stable sort?

879

---

How do arrays work?

928

---

How does linkedhashset work internally?

944

---

What is difference between arraylist and linkedlist?

1031

---

What is the difference between hashset and linkedhashset?

994

---

Which is faster hashmap or concurrenthashmap?

895

---

What is Jagged Arrays?

954

---

How do signed and unsigned numbers affect memory?

878

---