Greedy Algorithms
Master of Engineering (MEng) · University · Computer Science
This unit introduces the greedy approach to algorithm design, exploring its properties and limitations. Students will learn about classic greedy algorithms such as Huffman coding and Kruskal's algorithm, gaining a deep understanding of their applications and trade-offs.
What's included
- Introduction to greedy algorithms
- Properties of greedy algorithms
- Limitations of greedy algorithms
- Classic greedy algorithms (e.g.
- Huffman coding
- Kruskal's algorithm)
- Applications of greedy algorithms
- Time and space complexity analysis of greedy algorithms
- Comparison of different greedy algorithms
Keywords
- Greedy Algorithms
- Huffman Coding
- Kruskal's Algorithm
- Algorithm Design
- Optimization
- Time Complexity
- Space Complexity
- Applications