Algorithms and data structures
Greedy algorithms
Making the locally best choice, and proving when that gives the best answer overall.
About 10 hours of study.
Where to learn it
Read
Watch
Data Structures and Algorithms (NPTEL)
Naveen Garg, IIT Delhi
Lectures on greedy algorithms and minimum spanning trees
Section not checked yet
Practise
Other options
- Introduction to Algorithms, 4th edition (CLRS) (read, to go deeper, paid)
The chapter on greedy algorithms
Which roles ask for it
- GATE computer science to get hired
Before and after
Greedy algorithms
Opens up
Nothing else on the map yet.