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 vote201 views1 answer
C++ find index of all occurrences in string
C++
30 votes190 views2 answers
Integer range in c++
C++
0 vote181 views1 answer
C++ print to standard error
C++
0 vote197 views1 answer
Cpp get keystroke in console only
C++
0 vote209 views1 answer
Ex:Roblox
C++
-1 vote190 views1 answer
Fast way to check if a number is prime C++
C++
10 votes182 views3 answers
What is pi
C++
0 vote208 views1 answer
How to choose struct's endianness cpp
C++
0 vote215 views1 answer
How to format big numbers with commas in c++
C++
0 vote186 views1 answer
Appending int to string in cpp
C++