Tag: big-o-notation

Lecture 1: Goals of the course; what is computation; introduction to data types, operators, and variables

Lecture 2: Operators and operands; statements; branching, conditionals, and iteration

Lecture 4: Decomposition and abstraction through functions; introduction to recursion

Lecture 5: Floating point numbers, successive refinement, finding roots

Lecture 6: Bisection methods, Newton/Raphson, introduction to lists

Lecture 7: Lists and mutability, dictionaries, pseudocode, introduction to efficiency Instructors: Prof. Eric Grimson, Prof. John Guttag

Lecture 8: Complexity; log, linear, quadratic, exponential algorithms

Lecture 10: Divide and conquer methods, merge sort, exceptions

Lecture 11: Testing and debugging