Greedy Algorithms

Programming requires a good knowledge of the fundamentals of computer science, especially common data structures and algorithms. This class will cover greedy algorithms, a common approach to solving many basic problems. Greedy algorithms can be applied to a wide range of different problems, and work through choosing the optimal solution at each step of a process. Through applying the decision-making process of the greedy algorithm, we can frequently write simple and efficient code.

This class will cover topics including:

• Benefits, drawbacks, and use cases of greedy algorithms
• Examples of coding questions using greedy algorithms

This class is meant for those with some background in a programming language, though Python will be used for examples. Attendees with knowledge of another language should be able to grasp the concepts covered, and some attendees with enough math background but limited or no programming knowledge may be able to understand the class as well, at least on a conceptual level.