Skip to content

Glossary: Algorithms Beyond the Basics in JavaScript

Knapsack (0/1 knapsack)

Also written: 0/1 knapsack, knapsack problem

The problem of choosing items, each taken whole or not at all, for the most total value within a limit. Jo uses it to pick which roast batches fit in her 60 minutes (and later 180).

Where the book teaches it

Related terms

Dynamic programmingArray of arraysTabulation