Big O notation is used in computer science to describe the the performance or complexity of an algorithm. Big O specifically describes the the worst case scenario, and can be used to describe the execution time required or the space used.

References

  • https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/
  • https://justin.abrah.ms/computer-science/big-o-notation-explained.html
  • https://www.interviewcake.com/article/javascript/big-o-notation-time-and-space-complexity