Linear Search in C
Advertisements
Linear Search in C
Linear search is also called as sequential search. Linear search is a method for finding a particular value in a list. In this searching technique you need to check every elements one by one until desired element found.
Example of Linear Search
#include<stdio.h> #include<conio.h> void main() { int i,a[50],num,size; clrscr(); printf("Enter Size of array: "); scanf("%d",&size); printf("Enter %d element in array: \n",size); for(i=0;i<size;i++) { scanf("%d",&a[i]); } printf("Enter element for search: "); scanf("%d",&num); for(i=0;i<size;i++) { if(a[i]==num) // if element is found { printf("\n%d is present at %d position",num,i+1); break; } } if(i==size) { printf("\n %d is not found",num); } getch(); }
Output
Enter Size of array: 5 Enter 5 element in array 10 6 4 12 20 Enter element for search: 4 4 is present at 3 position
Google Advertisment