xxxxxxxxxx
#include <stdio.h>
int main()
{
int n;
printf("enter array limit :\n");
scanf("%d", &n);
printf("enter your array elements :\n");
int a[n], i;
for (i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
printf("your array is :\n");
for (i = 0; i < n; i++)
{
printf("%d\t", a[i]);
}
printf("\n");
printf("enter element that you want to search :\n");
int v;
scanf("%d", &v);
for (i = 0; i < n; i++)
{
if (a[i] == v)
{
return printf("your element is match in this array inwhich element no = %d", i + 1);
}
}
return printf("your enter element is't match...");
}
xxxxxxxxxx
#include <stdio.h>
int linearSearch(int a[], int n, int val) {
// Going through array sequencially
for (int i = 0; i < n; i++)
{
if (a[i] == val)
return i+1;
}
return -1;
}
int main() {
int a[] = {70, 40, 30, 11, 57, 41, 25, 14, 52}; // given array
int val = 41; // value to be searched
int n = sizeof(a) / sizeof(a[0]); // size of array
int res = linearSearch(a, n, val); // Store result
printf("The elements of the array are - ");
for (int i = 0; i < n; i++)
printf("%d ", a[i]);
printf("\nElement to be searched is - %d", val);
if (res == -1)
printf("\nElement is not present in the array");
else
printf("\nElement is present at %d position of array", res);
return 0;
}
linear search in c
xxxxxxxxxx
// C code to linearly search x in arr[].
#include <stdio.h>
int search(int arr[], int N, int x)
{
for (int i = 0; i < N; i++)
if (arr[i] == x)
return i;
return -1;
}
// Driver code
int main(void)
{
int arr[] = { 2, 3, 4, 10, 40 };
int x = 10;
int N = sizeof(arr) / sizeof(arr[0]);
// Function call
int result = search(arr, N, x);
(result == -1)
? printf("Element is not present in array")
: printf("Element is present at index %d", result);
return 0;
}