This course is a university-level exploration of algorithm and data structure analysis. Go beyond code: learn why algorithms work, not just how. The course covers core mathematical tools, various complexity analysis techniques, sorting algorithms, and data structures like heaps and hash tables. You will gain a deep understanding of algorithm analysis, a skill that remains important even with the rise of AI tools.
✏️ Course created by Qiang Hao, Ph.D. @structuredcs
? Get all course materials (quizzes, assignments, answers, solutions): https://github.com/StructuredCS/algorithm-analysis-deep-dive
❤️ Support for this channel comes from our friends at Scrimba – the coding platform that's reinvented interactive learning: https://scrimba.com/freecodecamp
⭐️ Contents ⭐️
⌨️ (0:00:00) Course overview
⌨️ (0:03:00) Introduction to time complexity
⌨️ (0:20:21) Time complexity analysis of insertion sort
⌨️ (0:41:35) Asymptotic analysis
⌨️ (1:16:32) Divide and conquer - Recurrence tree method
⌨️ (1:43:55) Divide and conquer - Master theorem
⌨️ (2:13:54) Probabilistic analysis - Quicksort
⌨️ (2:34:51) Probabilistic analysis - Average case and expected value
⌨️ (3:08:31) Heaps and heapsort
⌨️ (4:11:47) Hashtables
⌨️ (4:50:55) Binary search trees
⌨️ (5:42:50) Amortized analysis
? Thanks to our Champion and Sponsor supporters:
? Drake Milly
? Ulises Moralez
? Goddard Tan
? David MG
? Matthew Springman
? Claudio
? Oscar R.
? jedi-or-sith
? Nattira Maneerat
? Justin Hual
--
Learn to code for free and get a developer job: https://www.freecodecamp.org
Read hundreds of articles on programming: https://freecodecamp.org/news