C program to compute linear and binary search?

Answer 1

#include

#include

#include

void main(){

int arr[100],i,element,no;

clrscr();

printf("\nEnter the no of Elements: ");

scanf("%d", &no);

for(i=0;i

printf("\n Enter Element %d: ", i+1);

scanf("%d",&arr[i]);

}

printf("\nEnter the element to be searched: ");

scanf("%d", &element);

for(i=0;i

if(arr[i] == element){

printf("\nElement found at position %d",i+1);

getch();

exit(1);

}

}

printf("\nElement not found");

getch();

}

Output:

Enter the no of Elements: 5

Enter Element 1: 12

Enter Element 2: 23

Enter Element 3: 52

Enter Element 4: 23

Enter Element 5: 10

Enter the element to be searched: 23

Element found at position 2

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;

}