Big-O Notation

Big-O notation is the language we use for talking about how long an algorithm takes to run (time complexity) or how much memory is used by an algorithm (space complexity). Big-O notation can express the best, worst, and average-case running time of an algorithm.


A Rescursive function is a function that calls itself inside of its own definition. This video will help you understand functions and how to use them.