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);
}
| Is This Answer Correct ? | 4 Yes | 2 No |
Post New Answer View All Answers
Which list does not allow duplicates?
Explain what is binary search?
Differentiate between failfast and failsafe.
Can a tree be empty?
Explain the types of linked lists.
What are the tasks performed during preorder traversal?
What do you mean by Runtime Error
Which sorting algorithm is worst?
Explain Queue
How can we remove loops in a linked list? What are the functions of fast and slow pointers?
Why quicksort is called quick?
What is a priority queue?
How many times is merge sort called?
How do you sort in ascending order in arraylist?
Explain pre-order and in-order tree traversal.
