Understanding how your code performs is just as important as writing it correctly. This course introduces you to the essential concepts of algorithmic complexity, helping you evaluate and express the efficiency of algorithms using Big-O notation and its related forms (Omega and Theta).
This is a light, video-based course — no coding required. Just watch the content at your own pace, take notes, and build intuition. Don't worry about grasping every bit of math; focus on developing the ability to reason about algorithm performance.
Once you’re familiar with the concepts, reinforce your knowledge through the dedicated chapter and quiz in Cracking the Coding Interview.
By the end, you’ll be able to read, analyze, and discuss algorithms confidently using the language of complexity.
- Teacher: Zaien Aji Trahutomo