Big O Linear Time

bigO-linear-time.js

// Represents an algorithm who’s complexity will grow in direct proportion to the size of the input data

// 1.

for (const x of Array(n).keys()) {    // n
  console.log(x);                     // O(1)
}

// n * O(1) = O(n)

// 2.

y = 1 + 2;                            // O(1)
for (const x of Array(n).keys()) {    //
  console.log(x, y);                  // O(n)
}                                     //

// O(1) + O(n) = O(n)