Divide & Conquer Algorithm In 3 Minutes

A quick explainer for Design & Analysis of Algorithms (MIT 6.046) by Kantan Coding. 3 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.