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 vote285 views1 answer
C+ - Dormir en millisecondes
C++
0 vote255 views1 answer
C++ generate random number upper and lower bound
C++
16 votes263 views5 answers
Sort array c++
C++
0 vote262 views1 answer
Size of set c++
C++
0 vote246 views1 answer
Maximum subarray leetcode c++
C++
0 vote266 views1 answer
At c++ vector
C++
0 vote241 views6 answers
C++ to c converter online
C++
20 votes290 views3 answers
How to append to a vector c++
C++
0 vote256 views1 answer
C++ pause linux
C++
0 vote268 views1 answer
FlipperRSocketResponder.cpp command failed react native
C++