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

19 votes248 views1 answer
File handling in c++
C++
1 vote225 views1 answer
Xmake set binary name
C++
1 vote183 views1 answer
Marksheet make in the c++
C++
1 vote181 views1 answer
Why are inline keyword in header c++
C++
8 votes183 views3 answers
Min in c++
C++
0 vote167 views1 answer
Cyclic array rotation in cpp
C++
0 vote177 views1 answer
How to write int variable c++
C++
0 vote200 views2 answers
C++ typeid
C++
6 votes192 views6 answers
C++ for loop
C++
1 vote168 views2 answers
Cpp vector2
C++