Skip to content

JavaScript Algorithms: Linear Search

The Valley of Code

Your Web Development Manual

Linear search, also called sequential or simple, is the most basic search algorithm. Given a data structure, for example an array, we search for an item by looking at all the elements, until we find it.

Its implementation is very simple:

const linearSearch = (list, item) => {
  for (const [i, element] of list.entries()) {
    if (element === item) {
      return i

This returns the index of the item we’re looking for. Example:

linearSearch(['a', 'b', 'c', 'd'], 'd') //3 (index start at 0)

If we look for β€˜a’, the algorithm will only look at the first element and return, so it’s very fast.

But if we look for the last element, the algorithm needs to loop through all the array. To calculate the Big O value we always look at the worst-case scenario.

So the algorithm complexity is O(n).

β†’ Get my JavaScript Beginner's Handbook
β†’ Read my JavaScript Tutorials on The Valley of Code
β†’ Read my TypeScript Tutorial on The Valley of Code
  • THE VALLEY OF CODE (+ PRO), your web development manual
  • I wrote 15+ free coding BOOKS, download them here
  • SOLOPRENEUR LAND the missing MBA for wannabe solopreneurs craving a life with more freedom, control, fulfillment and purpose (summer 2024)