Intro

Let's discover algorithms and data structures.

Big O notation

Always 3 operations: O(1) (big O of one)

function addUpTo(n) {
  return (n * (n + 1)) / 2;
}

Numbers of operations: O(n) (big O of n)

function addUpTo(n) {
  let total = 0;
  for (let i = 0; i < n; i++) {
    total += i;
  }
  return total;
}

So we can just simplify this and say that the big o of this is o of n, because as n grows, the number of operations grows in proportion with n.

O(n) operation inside of an O(n) operation, will be O of n sqaure

O(n2)

function printALlPairs(n)=>{

  for(let i=0;i<n;i++){
     for(let j=0;j<n.length;j++){
      console.log(j,n);
     }
  }

}

Chart