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
Which is the fastest sorting?
Explain the types of linked lists.
What is data structures in computer science?
Explain the Queue
What is binary tree example?
What is the meaning of arraylist?
What are binary trees?
How do you declare A pointer to array of three chars
What is a hash index?
How does the bubble sort work?
What is collection process?
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
Define balancing condition for AVL Tree.
Write the stack overflow condition.
Is collection a class or interface?
