CyberLogic Academy

Curriculum Labs Community

CS MODULE CURRICULUM

Logic Foundations

Overview Curriculum Labs

Modules

Documentation Support

Linear Search .sequential

Sequential scan through unstructured data

Speed: 800ms

Comparisons

0

Scanning

Found

Checked

Current Index

—

Current Value

—

Target Value

—

Step: 1 / 0

0% Complete

LINEAR_SEARCH.JS

function linearSearch(array, target) {
    // Iterate through each element
    for (let i = 0; i < array.length; i++) {
        const currentValue = array[i];

        // Check if current element matches target
        if (currentValue === target) {
            return i; // Found at index i
        }
    }

    // Target not found in array
    return -1;
}

Complexity AnalysisO(n)

Time: O(n)Space: O(1)

Pro Tip

Linear search is best for small or unsorted datasets. For sorted data, binary search offers O(log n) time complexity instead of O(n).

Algorithm Status

Initializing linear search...

Complexity Analysis

Best Case:O(1)

Average Case:O(n)

Worst Case:O(n)

Space:O(1)