Write a c program for binary searching?

Answer 1

/* C program for binary search: This code implements binary search in */

/* C language. It can only be used for sorted arrays, but it's fast as */

/* compared to linear search. If you wish to use binary search on an */

/* array which is not sorted then you must sort it using some sorting */

/* technique say merge sort and then use binary search algorithm to */

/* find the desired element in the list. If the element to be searched */

/* is found then its position is printed. */

#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;

}

Answer 2

1. #include

void main() { int a[7],i,t,m=0; printf("Enter your ascending sorted Numbers:"); for(i=0;i<7;i++) { scanf("%d",&a[i]); } do { printf("\nEnter your Number that you want to search:"); scanf("%d",&t); m=(0+7)/2; if(t!=a[m]) { if(t>a[m]) { m=(m+1+7)/2; if(t>a[m]) { printf("%d",m+1); } else if(ta[m]) { printf("%d",m+1); } else if(t