Answer Posted / shah varshil
#include<stdio.h>
main()
{
int c, first, last, middle, n, search, array[100];
printf("Enter number of elements\n");
scanf("%d",&n);
printf("Enter %d integers\n", n);
for ( c = 0 ; c < n ; c++ )
scanf("%d",&array[c]);
printf("Enter value to find\n");
scanf("%d",&search);
first = 0;
last = n - 1;
middle = (first+last)/2;
while( first <= last )
{
if ( array[middle] < search )
first = middle + 1;
else if ( array[middle] == search )
{
printf("%d found at location %d.\n", search, middle
+1);
break;
}
else
last = middle - 1;
middle = (first + last)/2;
}
if ( first > last )
printf("Not found! %d is not present in the list.\n",
search);
return 0;
}
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
Explain what is the type of the algorithm used in solving the 8 queens problem?
What is a minimum spanning tree?
What do you mean by free pool?
Does arraylist contain duplicates?
What does isempty() member method determines?
What is the difference between null and void pointer in data structures?
What is the Difference between sax and dom parser?
Is array faster than arraylist?
Is it necessary to sort a file before searching a particular item ?
How can you represent a linked list node?
How do you empty an arraylist?
Define balancing condition for AVL Tree.
What is circular queue in data structure?
What is the difference between list and arraylist?
What is binary tree used for?
