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 vote124 views1 answer
Fill vector with zeros c++
C++
0 vote137 views1 answer
Binpow in fenwick tree
C++
1 vote135 views1 answer
64 bit unsigned integer c++
C++
0 vote124 views1 answer
All usefull stls in cpp imports
C++
0 vote139 views1 answer
+++++++++
C++
0 vote128 views1 answer
This is my p phone number in punjabi
C++
-2 votes133 views1 answer
How to iterate through array in c++
C++
0 vote121 views1 answer
Pascal's triangle in c++ through pointer
C++
10 votes130 views3 answers
Remove last character from string c++
C++
2 votes125 views3 answers
Print space in array cpp
C++