Answer Posted / saisharath

#include<stdio.h>
#include<conio.h>
int nr_bin_search(int[],int,int);
void main()
{
int key,i,n,index,l[20];
printf("\n enter the number of elements in the list:");
scanf("%d",n);
printf("\n enter the elements of the list:");
for(i=0;i<n;i++)
scanf("%d",&l[i]);
printf("\n enter the key element to be searched in the
list:");
scanf("%d",&key);
index=nr_bin_search(l,n,key);
if(index==-1)
printf("\n search completed,element%d found in the list at
position %d",key,index);
getch();
}
int nr_bin_search(ints[],int n,int e)
{
int low_val,mid_val,high_val;
low_val=0;
high_val=0;
while(high_val>=low_val)
{
mid_val=(low_val+high_val)/2;
if(s[mid_val]==e)
return(mid_val);
if(s[mid_val]<e)
low_val=mid_val+1;
else
high_val=mid_val-1;
}
return-1;
}

Explain how is linked list implemented?

881

---

Which sorting is used in collections sort?

830

---

Explain the sorting algorithm that is most suitable to be used with single linked list?

795

---

Compare Queue and Topic ?

1065

---

Can map contain duplicate keys?

804

---

Is array a linked list?

872

---

What are the major data structures used in the following areas : network data model & hierarchical data model?

989

---

How does a selection sort work?

822

---

What is difference between map and hashmap?

955

---

Why do we need a data structure?

943

---

What are the advantages of selecetion sort?

1051

---

How do I sort hashset?

865

---

What is sequential mapping in data structure?

895

---

Can we add duplicate keys in a hashmap?

850

---

Is learning data structures necessary?

832

---