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

What are the objectives of studying data structures?

1083

---

How many pointers are necessary to implement a simple linked list?

1082

---

What is an array vs list?

815

---

Describe the complexity of Binary search

862

---

What is the complexity of bubble sort?

916

---

Is hashmap fail safe?

924

---

Can arraylist hold duplicates?

865

---

Write an algorithm for inserting and deleting an element from doubly linked list?

873

---

Which is better than array and linked list?

888

---

What is an externalizable interface?

925

---

Define a priority queue?

1052

---

What do you mean by external sorting?

828

---

Mention the steps to insert data at the starting of a singly linked list?

936

---

What is a threaded binary tree? Explain its operation with example?

1086

---

State the merit of linked representation of binary trees?

881

---