Introduction to Greedy Algorithms | GeeksforGeeks

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