This is an extremely interesting and very comprehensive presentation prepared just for you. In this video, you’ll hear Marina’s Intro to the Big O notation.
Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.
Expect a live coding session where Marina solves a Fibonacci sequence problem. During this session, you will have a chance to practice your skills in TDD and time complexity estimations of algorithms.