forked from TheAlgorithms/C
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlinear_search.c
36 lines (31 loc) · 898 Bytes
/
linear_search.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
#include <stdio.h>
#include <stdlib.h>
int linearsearch(int *arr, int size, int val)
{
int i;
for (i = 0; i < size; i++)
{
if (arr[i] == val)
return 1;
}
return 0;
}
int main()
{
int n, i, v;
printf("Enter the size of the array:\n");
scanf("%d", &n); // Taking input for the size of Array
int *a = (int *)malloc(n * sizeof(int));
printf("Enter the contents for an array of size %d:\n", n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]); // accepts the values of array elements until the
// loop terminates//
printf("Enter the value to be searched:\n");
scanf("%d", &v); // Taking input the value to be searched
if (linearsearch(a, n, v))
printf("Value %d is in the array.\n", v);
else
printf("Value %d is not in the array.\n", v);
free(a);
return 0;
}