References#
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3rd edition, 2009. ISBN 0262033844.
Erik Demaine, Jason Ku, and Justin Solomon. 6.006: introduction to algorithms - spring 2020. MIT OpenCourseWare, 2020. Course Description: This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques. URL: https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/.
GeeksforGeeks. 0-1 knapsack problem - dynamic programming. 2024. Accessed: 2024-07-31. URL: https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/.
NeetCode. Advanced algorithms course. 2024. Accessed: 2024-07-31. URL: https://neetcode.io/courses/advanced-algorithms.
Stackademic. Knapsack problem: dynamic programming solution. 2024. Accessed: 2024-07-31. URL: https://blog.stackademic.com/knapsack-problem-dynamic-programming-solution-bdf48365b759.