Free courses from frontend to fullstack and AI
AI Engineer - Learn how to integrate AI into software applications
Overview
Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
Introduces time complexity through the running time of a palindrome-deciding machine, worst-case analysis, formal and informal Big O definitions, and common runtime scaling.
Syllabus
Intro
In 1993, noted comedian Demetri Martin took a math course at Yale called Fractal Geometry.
Running time of deciding PALINDROME
Instance/input length
Defining running time
Why worst case?
Our Palindrome TM had running time
INFORMAL Definition
Examples
Formal definition of O(n?)
Common run-time scaling
A log-log plot Say 1 step = 1 us
Intrinsic complexity
Taught by
Ryan O'Donnell