Answer Posted / saisharath
#include<stdio.h>
#include<conio.h>
int nr_bin_search(int[],int,int);
void main()
{
int key,i,n,index,l[20];
printf("\n enter the number of elements in the list:");
scanf("%d",n);
printf("\n enter the elements of the list:");
for(i=0;i<n;i++)
scanf("%d",&l[i]);
printf("\n enter the key element to be searched in the
list:");
scanf("%d",&key);
index=nr_bin_search(l,n,key);
if(index==-1)
printf("\n search completed,element%d found in the list at
position %d",key,index);
getch();
}
int nr_bin_search(ints[],int n,int e)
{
int low_val,mid_val,high_val;
low_val=0;
high_val=0;
while(high_val>=low_val)
{
mid_val=(low_val+high_val)/2;
if(s[mid_val]==e)
return(mid_val);
if(s[mid_val]<e)
low_val=mid_val+1;
else
high_val=mid_val-1;
}
return-1;
}
| Is This Answer Correct ? | 11 Yes | 13 No |
Post New Answer View All Answers
What is reduction to sorting method?
Why use a tuple instead of a list?
Explain the common uses of threaded binary tree.
Define splay tree?
How null key is handled in hashmap?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
Why quicksort is better than merge sort?
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
What is dynamic array in excel?
Describe tree rotation in avl tree.
How to reverse a singly linked list?
What are the different types of data structures?
State the merits of linear representation of binary trees?
What is the space complexity of quicksort?
What is bubble insertion selection sort?
