Learning JavaScript Data Structures and Algorithms - Third Edition

O(n)

Now, let's use the sequential search algorithm we implemented in Chapter 13, Sorting and Searching Algorithms, as an example:

function sequentialSearch(array, value, equalsFn = defaultEquals) {  for (let i = 0; i < array.length; i++) {    if (equalsFn(value, array[i])) { // {1}      return i;    }  }  return -1;}

If we pass an array with 10 elements ([1, ..., 10]) to this function and search for element 1, in the first attempt, we will find the element we are looking for. Let's suppose the cost is 1 for each time we execute line {1}.

Let's try another example. Suppose we are searching for element 11. Line {1} will be executed 10 times (it will iterate through all of the values of the array and it will not find the value we are looking for; therefore, ...