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;
}

Which language is best to learn data structures?

997

---

Is treemap synchronized?

915

---

List out the disadvantages of using a linked list?

938

---

What is data and data types?

925

---

What are the properties of binary tree?

908

---

What is the use of sorting?

956

---

What is data structure and its operations?

844

---

How can I study data structures and algorithms?

961

---

Is list a data type?

908

---

What is meant by binary tree traversal?

971

---

Write an algorithm to show the reverse of link list?

858

---

what is a balanced tree.

985

---

Differentiate between comparable and comparator.

1039

---

What is a treeset?

899

---

Is file a data structure?

965

---