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 is sequential search?

948

---

Difference between arrays and linked list?

949

---

What are data structures in programming?

975

---

What is treemap chart?

867

---

What is a reverse linked list.

1034

---

What is the complexity of arraylist?

941

---

Can hashmap be sorted?

919

---

What are different types of sorting techniques?

936

---

What is a stable sorting algorithm?

1084

---

What is time complexity of binary search?

898

---

What is stack and queue in data structure?

939

---

Why do we use data structures?

912

---

Differentiate between queue and stack.

1215

---

Write program for Quick sort ?

1107

---

Why is treeset sorted?

990

---