PYTHON

linear search c+ with function

#include <bits/stdc++.h>
using namespace std;
 
// Linearly search x in arr[]. If x is present then return
// its location, otherwise return -1
int search(int arr[], int n, int x)
{
    int i;
    for (i = 0; i < n; i++)
        if (arr[i] == x)
            return i;
    return -1;
}
 
// Driver code
int main()
{
    int arr[] = { 3, 4, 1, 7, 5 };
    int n = sizeof(arr) / sizeof(arr[0]);
    int x = 4;
 
    int index = search(arr, n, x);
    if (index == -1)
        cout << "Element is not present in the array";
    else
        cout << "Element found at position " << index;
 
    return 0;
}

linear search in c++

bool linearsearch(int A[], int N, int X) {
  for (int i=0; i<N; i++) 
    if (A[i] == X) return true;
  return false;
}

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.
"""