linear search:
#include<stdio.h>
void main()
{
int array[25], search, c, number;
printf("Enter the No of element in array\n");
scanf("%d",&number);
printf("Enter %d numbers\n", number);
for ( c = 0 ; c < number ; c++ )
scanf("%d",&array[c]);
printf("Enter the No to search\n");
scanf("%d",&search);
for ( c = 0 ; c < number ; c++ )
{
if ( array[c] == search ) /* if necessary factor found */
{
printf("%d is present at place %d.\n", search, c+1);
break;
}
}
if ( c == number )
printf("%d is not present in range.\n", search);
getch0;
}
output:-
linear search for multiple occurrences
#include<stdio.h>
void main()
{
int array[30], search, c, n, count = 0;
printf("Enter the No. of elemant in array\n");
scanf("%d",&n);
printf("Enter %d numbers\n", n);
for ( c = 0 ; c < n ; c++ )
scanf("%d",&array[c]);
printf("Enter the No. to search\n");
scanf("%d",&search);
for ( c = 0 ; c < n ; c++ )
{
if ( array[c] == search )
{
printf("%d is present at location %d.\n", seaech, c+1);
count++;
}
}
if ( count == 0 )
printf("%d is not existing in array.\n", search);
else
printf("%d is present %d times in array.\n", search, count);
getch0;
}
output:-
C program for linear search using function:
#include<stdio.h>
#include<conio.h>
int linear_search(int*, int, int);
void main()
{
int array[30], search, c, n, position;
printf("Enter the No. of element in array\n");
scanf("%d",&n);
printf("Enter %d numbers\n", n);
for ( c = 0 ; c < n ; c++ )
scanf("%d",&array[c]);
printf("Enter the No. to search\n");
scanf("%d",&search);
position = linear_search(array, n, search);
if ( position == -1 )
printf("%d is not existing in array.\n", search);
else
printf("%d is present at place %d.\n", search, position+1);
getch0;
}
int linear_search(int *pointer, int n, int find)
{
int c;
for ( c = 0 ; c < n ; c++ )
{
if ( *(pointer+c) == find )
return c;
}
return -1;
}
No comments:
Post a Comment