Understanding Big O

Kyle and Linda discuss Big O analysis, a type of analysis used by computer scientists to study the runtime of linear algorithms. They use the example of calculating a restaurant tip to explain how algorithms work and how they can be constant time regardless of input size.