Interested to Buy Any Domain ? << Click Here >> for more details...
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
Differentiate between hashset and hashmap.
Why quicksort is better than merge sort?
What is array traversing?
Is array a data type?
What is the use of treemap?
How to check array contains value or not?
What is data structure? Explain.
Which interfaces are implemented by linkedhashset?
Explain how to find 3rd element from end in a linked list in one pass?
What is data and its type?
What type of data structure is used to perform recursion?
Why do we need linked list?
Define biconnectivity?
What are the difference between malloc() and calloc()?
Does treemap sort automatically?
