Skip to main content

C Program To Implement Linear Search.

The following code implements linear search (Searching algorithm) which is used to find whether a given number is present in an array or not and if it is present then at what location it occurs. It is also known as sequential search. It is very simple and works as follows: we keep on comparing each element with the element to search until the desired element is found. Time required to search an element using linear search algorithm depends on the size of list. In the best case, element is present at the beginning of list and in the worst case, element is present at the end. Time complexity of linear search is O(n). 

#include <stdio.h>

int main() {
int array[100], search, c, n;

printf("\nEnter the number of elements in array: ");
scanf("%d",&n);

printf("\n\nEnter %d integer(s): \n", n);
for (c = 0; c < n; c++)
scanf("%d", &array[c]);

printf("\n\nEnter the number to search: ");
scanf("%d", &search);

for (c = 0; c < n; c++) {
if (array[c] == search) {
printf("\n%d is present at location %d.\n\n", search, c+1);
break;
}}

if (c == n)
printf("\n%d is not present in array.\n\n", search);
return 0;
}

Linear search for multiple occurrences: n the code below we will print all the locations at which required element is found and also the number of times it occur in the list.

#include <stdio.h>

int main() {
int array[100], search, c, n, count = 0;

printf("\nEnter the number of elements in array: ");
scanf("%d", &n);

printf("\n\nEnter %d numbers: \n", n);
for ( c = 0 ; c < n ; c++ )
scanf("%d", &array[c]);

printf("\n\nEnter the number to search: ");
scanf("%d", &search);

for (c = 0; c < n; c++) {
if (array[c] == search) {
printf("\n%d is present at location %d.\n\n", search, c+1);
count++;
}}
if (count == 0)
printf("\n%d is not present in array.\n\n", search);
else
printf("\n%d is present %d times in array.\n\n", search, count);
return 0;
}

Linear search using function
#include <stdio.h>
long linear_search(long [], long, long);

int main() {
long array[100], search, c, n, position;

printf("Input number of elements in array: ");
scanf("%ld", &n);

printf("\n\nInput %d numbers: ", n);
for (c = 0; c < n; c++)
scanf("%ld", &array[c]);

printf("\n\nInput number to search: ");
scanf("%ld",&search);

position = linear_search(array, n, search);

if (position == -1)
printf("\n%d is not present in array.\n\n", search);
else
printf("\n%d is present at location %d.\n\n", search, position+1);
return 0;
}

long linear_search(long a[], long n, long find) {
long c;
for (c = 0 ;c < n ; c++ ) {
if (a[c] == find)
return c;
}
return -1;
}

Linear search using pointer: copy the first part (L.S. with function)
long linear_search(long *pointer, long n, long find) {
long c;
for (c = 0; c < n; c++) {
if (*(pointer+c) == find)
return c;
}
return -1;
}
Labels:

Popular posts from this blog

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01 , also released in 1985, was the first point-release after Windows 1.00.   Screenshots from Windows 1.01: ⇰ Desktop  First Run Empty Desktop Desktop With Applications ⇰  Office Applications Notepad Text Editor Calculator Calendar Clock Address Book ⇰  Multimedia Applications Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features. ⇰  Networking Applications Terminal Phone Dialer: This GUI doesn’t have this feature. ⇰  Internet Applications Browser, and Mail: This GUI doesn’t have these features. ⇰  Accessibility Applications Keyboard Map:  This GUI doesn’t have this feature. ⇰  Settings Desktop themes,  Display,  S...
Read more

C Program To Check Whether A Number Is Palindrome Or Not.

This program takes an integer from user and the integer is reversed. If the reversed integer is equal to the integer entered by user then that number is a palindrome. If not that number is not a palindrome.   #include <stdio.h> int main()  { int num, temp, remainder, reverse = 0; printf("Enter an integer: "); scanf("%d", &num); /*  original number is stored at temp */ temp = num; while (num > 0)  { remainder = num % 10; reverse = reverse * 10 + remainder; num /= 10;   }
Read more

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;
Read more

C Program To Convert Natural Numbers To Roman Numerals.

Roman Number System of representing numbers devised by the ancient Romans. The numbers are formed by combinations of the symbols I, V, X, L, C, D, and M, standing, respectively, for 1, 5, 10, 50, 100, 500, and 1,000 in the Hindu-Arabic numeral system. Natural numbers mean no negative numbers and no fractions, i.e. the whole numbers from 1 upwards: 1, 2, 3, and so on. Here is source code of the C program to convert natural numbers to Roman Numerals. It compiles and runs on any operating system. #include <stdio.h> void predigit(char num1, char num2); void postdigit(char c, int n); char romanval[1000]; int i = 0; int main() { int j; long number; printf("Enter any natural number: "); scanf("%d", &number);
Read more