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
What is data structure and its operations?
Define double linked list?
How do you use merge sort?
Is duplicate allowed in hashmap?
Why are b trees used?
How is hashmap o 1?
What is a linear search?
Give the example of validating the parenthesis of expression using stack.
Run time memory allocation is known as in data structure?
Is set sorted?
What is complexity of quicksort?
What is the difference between adt and data structure?
Which interfaces are implemented by abstractqueue?
Explain multiply linked list in short.
What do you understand by doubly linked list?
