Completed
Formal definition of O(n?)
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Great Ideas in Theoretical Computer Science: Time Complexity - Spring 2016
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 In 1993, noted comedian Demetri Martin took a math course at Yale called Fractal Geometry.
- 3 Running time of deciding PALINDROME
- 4 Instance/input length
- 5 Defining running time
- 6 Why worst case?
- 7 Our Palindrome TM had running time
- 8 INFORMAL Definition
- 9 Examples
- 10 Formal definition of O(n?)
- 11 Common run-time scaling
- 12 A log-log plot Say 1 step = 1 us
- 13 Intrinsic complexity
