A greedy algorithm is an algorithm that picks the locally optimal choice at every step, hoping to get to the global optimum, or somewhere close to it.
Greedy algorithm
Reading time: less than 1 minute
The following pages link here
Citation
If you find this work useful, please cite it as:@article{yaltirakli, title = "Greedy algorithm", author = "Yaltirakli, Gokberk", journal = "gkbrk.com", year = "2025", url = "https://www.gkbrk.com/greedy-algorithm" }
Not using BibTeX? Click here for more citation styles.
IEEE Citation
Gokberk Yaltirakli, "Greedy algorithm", September, 2025. [Online]. Available: https://www.gkbrk.com/greedy-algorithm. [Accessed Sep. 12, 2025].
APA Style
Yaltirakli, G. (2025, September 12). Greedy algorithm. https://www.gkbrk.com/greedy-algorithm
Bluebook Style
Gokberk Yaltirakli, Greedy algorithm, GKBRK.COM (Sep. 12, 2025), https://www.gkbrk.com/greedy-algorithm
