C

linear search in c languge

#include <stdio.h>
int main()
{
    int n;
    printf("enter array limit :
");
    scanf("%d", &n);
    printf("enter your array elements :
");
    int a[n], i;
    for (i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    printf("your array is :
");
    for (i = 0; i < n; i++)
    {
        printf("%d	", a[i]);
    }
    printf("
");
    printf("enter element that you want to search :
");
    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...");
}

linear search program in c

#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("
Element to be searched is - %d", val);  
  if (res == -1)  
  printf("
Element is not present in the array");  
  else  
  printf("
Element is present at %d position of array", res);  
  return 0;  
} 

linear search in c

# Linear Search:

"""
Another classic example of a brute force algorithm is Linear Search. 
This involves checking each item in a collection to see if it is the 
one we are looking for.
In Python, it can be implemented like this:

"""

arr = [42,2,3,1,4,6]
search_n = 2
for position, item in enumerate(arr):
    if item == search_n:
        print("%d The searching number is at position %d inside the array."%(search_n,position+1))
        break
else:
    print("Sorry! Not Found.")
    
"""
Of course there are many different implementations of this algorithm. 
I like this one because it makes use of Python’s very handy enumerate function. 
Regardless of the details of the implementation, 
the basic idea remains the same – iterate through the collection (in the case above, a Python list), 
and check if each item is the target.I like to use the variable names search_n and array from the 
expression looking for a search_n in a array.
"""