Pătcaş, CsabaIonescu, Klára2024-09-042024-09-042008-12-31Teaching Mathematics and Computer Science, Vol. 6 No. ID (2008) , 37-711589-7389https://hdl.handle.net/2437/379650We propose a new kind of approach of the teaching of knapsack type problems in the classroom. We will remind you the context of the general knapsack-task and we will classify it, including the two most popular task variants: the discrete and the continuous one. Once we briefly present the solving algorithm of the continuous variant, we will focus on the solving of the discrete task, and we will determine the complexity of the algorithms, looking for different optimizing possibilities. All these issues are presented in a useful way for highschool teachers, who are preparing students in order to participate in different programming contests.application/pdfteachingalgorithmknapsackdynamic programming methodoptimizationreportfolyóiratcikkOpen AccessCsaba Pătcaş and Klára Ionescuhttps://doi.org/10.5485/TMCS.2008.R008Teaching Mathematics and Computer ScienceID6Teach. Math. Comp. Sci.2676-8364