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 is queue example?

925

---

What is a treemap used for?

888

---

How to get top two numbers from an array?

1086

---

Why is quicksort unstable?

958

---

What are the advantages and disadvantages of copyonwritearraylist?

1131

---

Can a hashset contain duplicates?

945

---

Describe what is Node in link list? And name the types of Linked Lists?

922

---

What are the advantages of data structure?

964

---

Can we sort hashmap?

893

---

Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?

954

---

What is thread and types of thread?

950

---

Is quicksort divide and conquer?

917

---

What is the use of threaded binary tree?

996

---

What is difference between tree and binary tree?

984

---

Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).

933

---