# Complexity Classes

Notes from Week 5 of the MIT Introduction to Computer Science 6.00.1 MOOC. Extensive notes in this .pdf from the class. Further notes related to python here: Assess the complexity of an algorithm from worse cases of input size: O(1): constant running time (or ‘Constant Complexity’); all mathematical operations are O(1); def inc(x): return x+1 […]