DEV Community

loading...
Cover image for Linear Search Algorithm

Linear Search Algorithm

Aya Bouchiha
Full stack web developer
Updated on ・2 min read

Linear Search Definition

Linear search also called sequential search is a type of search algorithms, that traverse an array and compare each item with the wanted item, if the item is found the algorithm returns his index otherwise, It returns a false value (false, null, None...)

Linear search algorithm Aya Bouchiha

Space and Time complexity of linear search

The time complexity of linear search is O(n) and his Space complexity is O(1)

line-graph

Implementaion of linear search in python

def LinearSearchAlgorithm(wantedItem,items: list):
    """
        Linear seach algorithm
        input: 
            [wantedItem]
            [items] {list}
        output:
            => returns index if the item is found
            => returns False if the item is not found
    """
    for i in range(len(items)):
        if wantedItem == items[i]:
            return i
    return False
Enter fullscreen mode Exit fullscreen mode

Implementaion of linear search in javascript

/**
 * Linear Search ALgoritm
 * @param  wantedItem 
 * @param {Array} items 
 * @returns {(Number|Boolean)} returns index if the item is found else returns false.
 */
const LinearSearchAlgorithm = (wantedItem, items) => {
    for (let i = 0; i < items.length; i++){
        if (wantedItem == items[i]) return i;
    };
    return false;
}

Enter fullscreen mode Exit fullscreen mode

Exercise

Write a program that returns True if user's child can enter primary school if not returns False
Permited Ages to enter primary school: 5,6,7,8 (Array | list).
input : child's age (integer).
example 1
input : 7
output => True
example 2
input : 3
output => False

References and useful Resources

#day_5

Discussion (0)