Linear search

Isabelle Viktoria Maciohsek · JavaScript, Algorithm, Array · Dec 28, 2020

Finds the first index of a given element in an array using the linear search algorithm.

  • Use a loop to iterate over the indexes of the given array.
  • Check if the element in the corresponding index is equal to item.
  • If the element is found, return the index, using the unary + operator to convert it from a string to a number.
  • If the element is not found after iterating over the whole array, return -1.
const linearSearch = (arr, item) => {
  for (const i in arr) {
    if (arr[i] === item) return +i;
  return -1;
linearSearch([2, 9, 9], 9); // 1
linearSearch([2, 9, 9], 7); // -1

Recommended snippets

  • Binary search

    JavaScript, Algorithm

    Finds the index of a given element in a sorted array using the binary search algorithm.

  • K-means clustering

    JavaScript, Algorithm

    Groups the given data into k clusters, using the k-means clustering algorithm.

  • Heap sort

    JavaScript, Algorithm

    Sorts an array of numbers, using the heapsort algorithm.