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
Write an algorithm to find middle element in the linked list.
What is default size of hashmap?
Which sorting is best for large data?
Can you make an arraylist of arrays?
What is hashing technique?
Write an algorithm to show various operations on ordered list and arrays
Is quicksort a stable sorting algorithm?
Define ancestor and descendant ?
Is hashmap part of collection?
Can the double-checked locking fail on a single processor system?
Which is the best book for data structures and algorithms?
What is difference between list set and map?
What is linked list with example?
What is collection process?
What stack means?
