Big O notation (pronounced Big-Oh) is a way to discuss how long an algorithm takes to run. It is also called "runtime complexity". Understanding th

Big O notation (pronounced Big-Oh) is a way to discuss how long an algorithm takes to run. It is also called "runtime complexity". Understanding th