Greedy Algorithms - Algorithms Part 6
In this lecture, we introduce the notion of greedy algorithms and discuss how to design greedy algorithms to obtain optimal solutions to problems such as the fractional knapsack and activity selection.
For more information about the 0/1 Knapsack problem, see part 2 of the algorithm series on dynamic programming: • Dynamic Programming - Algorithms Part 2 (the link may not work right now because I can't link until 2 months after the channel is created)
Timestamps:
00:00 Introduction
00:28 Greedy Formulation
02:06 Fractional Knapsack
05:17 Activity Selection
09:05 Conclusion
#greedyalgorithms #approximation #fractionalknapsack #knapsack #activityselection #algorithms #timecomplexity #computerscience