Answer Posted / s.devudu

#include<stdio.h>
int binarysearchr(int a[],int,int,int);
void main()
{
int a[],i,j,b,n,key,temp;
clrscr();
printf("enter the n value");
scanf("%d",&n);
printf("enter the array values");
for(i=0;i<=n;i++)
scanf("%d",&a[i]);
for(i=0;i<=n;i++)
{
for(j=0;j<=n-1;j++)
{
if(a[j]>=a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
printf("in an array after sorting");
scanf(%d\t",&a[i]);
printf("enter the key value");
for(i=0;i<=n;i++)
scanf(%d",&key);
b=binarysearchr(int a[],int i,int n,int key);
if(b)
printf("location of key element is %d\n",b);
else
printf("key not found");
getch();
}
int binarysearchr(int a[],int low,int high,int key);
{
int mid;
if(low>high)
return 0;
mid=(low+high)/2;
if(key==a[mid])
return mid;
else if(key<=a[mid])
return binarysearchr(a,mid-1,high,key);
else
reurn binarysearch(a,low,mid+1,key);
}

Which sorting algorithms are in place?

944

---

Which interfaces are implemented by linkedhashset?

1083

---

Explain the difference between a list and array.

1008

---

What is the minimum number of nodes in an avl tree of height h?

929

---

Name some applications which use linked lists.

1043

---

Is arraylist faster than array?

957

---

Define threaded binary tree. Explain its common uses

926

---

What do you mean by data types?

1005

---

What is difference between for loop and foreach?

919

---

What’s the difference between enumeration and iterator interfaces?

979

---

Why is quicksort better than mergesort?

961

---

What is the best data structure and algorithm to implement cache?

1010

---

What is data structure and data type?

1009

---

What is range search?

929

---

How to excel in data structures and algorithms?

999

---