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 vote105 views1 answer
Initialize a vector with another vector c++ complexity
C++
0 vote93 views7 answers
C++ convert to c online
C++
0 vote109 views1 answer
Memset array bool
C++
0 vote106 views1 answer
Sort html elements in Jquery on condition
C++
0 vote112 views1 answer
Flutter websocket auto reconnect
C++
1 vote110 views1 answer
Elixir update map
C++
15 votes90 views3 answers
Char to string c++
C++
1 vote93 views1 answer
Vector library c++
C++
0 vote107 views1 answer
Currency Converter c++
C++
0 vote106 views1 answer
CamelCase Problem
C++