Linear search

#include <bits/stdc++.h>

using namespace std; 

int search(int arr[], int n, int key) 
{ 
    int i; 
    for (i = 0; i < n; i++) 
        if (arr[i] == key) 
            return i; 
    return -1; 
} 

int main() 
{ 
    int arr[] = { 99,4,3,8,1 }; 
    int key = 8; 
    int n = sizeof(arr) / sizeof(arr[0]); 

    int result = search(arr, n, key); 
    (result == -1) 
        ? cout << "Element is not present in array"
        : cout << "Element is present at index " << result; 

    return 0; 
}

What is linear search

A linear search is the simplest method of searching a data set. Starting at the beginning of the data set, each item of data is examined until a match is made. Once the item is found, the search ends.

Linear search implementation

def linear_search(lst, target):
    """Returns the index position of the target if found, else returns -1"""

    for i in range(0, len(lst)):
        if lst[i] == target:
            return i
    return -1

Source: teamtreehouse.com

Similar codes

0 vote210 views1 answer
Flake8 max line length
C++
19 votes160 views2 answers
C++ rewrite file
C++
0 vote177 views1 answer
Frequency of a substring in a string c++
C++
0 vote162 views1 answer
Argument to number C++
C++
0 vote169 views1 answer
Error C2011
C++
0 vote176 views1 answer
Lru cache gfg
C++
1 vote159 views1 answer
Ue4 find component c++
C++
2 votes158 views1 answer
Clrscr in cpp
C++
-1 vote163 views1 answer
Permutation c++
C++
41 votes202 views6 answers
Print hello world c++
C++