Design and Analysis of Algorithms

This course assumes that students know how to analyze simple algorithms and data structures from having taken 6.006. It introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms.
R1. Matrix Multiplication and the Master Theorem. R2. 2-3 Trees and B-Trees. R3. Amortization: Amortized Analysis. R4. Randomization: Universal & Perfect Hashing. R5. Dynamic Programming. Augmentation: Range Trees.

🆓 Free Online Course
💻 Lecture Videos
⏰ Duration : More than 1 hour
🏃‍♂️ Self paced
Source : MIT


🔗 Course Link


#programming #algorithms
➖➖➖➖➖➖➖➖➖➖➖➖➖➖
👉Join @leanex_cs_stuffs for more👈