L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

A quick explainer for Design & Analysis of Algorithms (MIT 6.046) by Gate Smashers. 8 min. Watch on YouTube

Course: Design & Analysis of Algorithms (MIT 6.046) (Computer Science). Covers: divide and conquer greedy network flow np-completeness randomized algorithms.