Custo computacional:
- https://neps.academy/lesson/159
- https://www.youtube.com/watch?v=ojCAnD7vrOY&list=RDCMUCBL2tfrwhEhX52Dze_aO3zA
- https://www.ime.usp.br/~pf/livrinho-AA/AA-SLIDES.pdf (até a página 58)
Algoritmos gulosos:
- https://neps.academy/lesson/157
- https://www.ime.usp.br/~pf/analise_de_algoritmos/aulas/guloso.html
- https://sites.google.com/site/itabits/treinamento/aulas-obi/algoritmos-gulosos
- https://www.youtube.com/watch?v=HzeK7g8cD0Y
- https://www.youtube.com/watch?v=318kd1Fiw3s
Activity Selection Problem:
- https://www.geeksforgeeks.org/activity-selection-problem-greedy-algo-1/?ref=lbp
- https://www.youtube.com/watch?v=poWB2UCuozA
- https://www.youtube.com/watch?v=i_G8hZYcKnI
Soma máxima (um pouco de PD):
- https://neps.academy/lesson/165
- https://www.ime.usp.br/~pf/livrinho-AA/AA-SLIDES.pdf (até a página 67)
- https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/
Extra: