Programming Concepts — Big O Notation

Big O notation describes the efficiency of an algorithm in terms of time complexity and space complexity as the input size grows.

// O(n) example
function printItems(arr) {
  arr.forEach(item => console.log(item));
}