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

Does array sort mutate?

759

---

What do you mean by open addressing?

919

---

What is heap with example?

867

---

What is meant by linked list?

854

---

Does arraylist contain duplicates?

827

---

Why quicksort is called quick?

858

---

Describe the degree term in a tree.

901

---

What is the difference between Array and Array List ? Explain in brief with example.

912

---

How do you rotate an AVL tree?

909

---

List the applications of queues?

885

---

Will arraylist maintain insertion order?

855

---

Give a real time example of stack

905

---

Which is faster array or list?

857

---

What are two types of sorting?

946

---

What is bubble sort?

832

---