Public
Edited
Aug 1, 2024
Insert cell
Insert cell
ITEMS = [
{ value: 1, size: 1 },
{ value: 6, size: 2 },
{ value: 10, size: 3 },
{ value: 16, size: 5 },
]
Insert cell
Insert cell
function knapsack(items, sizeLimit) {
let max = { value: 0, selection: [] };

function pick(selection, size, value) {
if (value > max.value) {
max = { value, selection }
}
const n = selection.length
if (n == items.length) return

pick([...selection, 0], size, value);
const item = items[n];
if (size + item.size <= sizeLimit) {
pick([...selection, 1], size + item.size, value + item.value);
}
}

pick([], 0, 0);
return [max.value, max.selection];
}
Insert cell
knapsack(ITEMS, 1)
Insert cell
knapsack(ITEMS, 2)
Insert cell
knapsack(ITEMS, 3)
Insert cell
knapsack(ITEMS, 4)
Insert cell
knapsack(ITEMS, 5)
Insert cell
knapsack(ITEMS, 6)
Insert cell
knapsack(ITEMS, 7)
Insert cell
knapsack(ITEMS, 8)
Insert cell
knapsack(ITEMS, 9)
Insert cell
knapsack(ITEMS, 10)
Insert cell
knapsack(ITEMS, 11)
Insert cell
knapsack(ITEMS, 12)
Insert cell
ITEMS_15 = [
{ value: 135, size: 70 },
{ value: 139, size: 73 },
{ value: 149, size: 77 },
{ value: 150, size: 80 },
{ value: 156, size: 82 },
{ value: 163, size: 87 },
{ value: 173, size: 90 },
{ value: 184, size: 94 },
{ value: 192, size: 98 },
{ value: 201, size: 106 },
{ value: 210, size: 110 },
{ value: 214, size: 113 },
{ value: 221, size: 115 },
{ value: 229, size: 118 },
{ value: 240, size: 120 },
]
Insert cell
RESULT_15 = knapsack(ITEMS_15, 750)
Insert cell
function count(arr) {
return arr.filter(v=>v).length
}
Insert cell
count(RESULT_15[1])
Insert cell
function selection(arr, items) {
return arr.reduce((acc, v, i) => {
if (v) acc.push(items[i])
return acc
}, [])
}
Insert cell
selection(RESULT_15[1], ITEMS_15)
Insert cell
ITEMS_24 = [
{ value: 825594, size: 382745 },
{ value: 1677009, size: 799601 },
{ value: 1676628, size: 909247 },
{ value: 1523970, size: 729069 },
{ value: 943972, size: 467902 },
{ value: 97426, size: 44328 },
{ value: 69666, size: 34610 },
{ value: 1296457, size: 698150 },
{ value: 1679693, size: 823460 },
{ value: 1902996, size: 903959 },
{ value: 1844992, size: 853665 },
{ value: 1049289, size: 551830 },
{ value: 1252836, size: 610856 },
{ value: 1319836, size: 670702 },
{ value: 953277, size: 488960 },
{ value: 2067538, size: 951111 },
{ value: 675367, size: 323046 },
{ value: 853655, size: 446298 },
{ value: 1826027, size: 931161 },
{ value: 65731, size: 31385 },
{ value: 901489, size: 496951 },
{ value: 577243, size: 264724 },
{ value: 466257, size: 224916 },
{ value: 369261, size: 169684 },
]
Insert cell
RESULT_24 = knapsack(ITEMS_24, 6404180)
Insert cell
count(RESULT_24[1])
Insert cell
selection(RESULT_24[1], ITEMS_24)
Insert cell
function knapsackI(items, sizeLimit) {
let max = { value: 0, selection: [] };
let selection = new Array(items.length).fill(0)

function pick(j, value, size) {
if (size > sizeLimit) return
if (value > max.value) {
max = { value, selection: [...selection] }
}
if (j == items.length) return

selection[j] = 0;
pick(j+1, value, size);
selection[j] = 1;
const item = items[j];
pick(j+1, value + item.value, size + item.size);
selection[j] = 0;
}

pick(0, 0, 0);
return [max.value, max.selection];
}
Insert cell
knapsackI(ITEMS_15, 750)
Insert cell
knapsackI(ITEMS_24, 6404180)
Insert cell
Insert cell
function knapsackR(items, sizeLimit) {
function solve(n, size) {
if (n == 0) return 0;
if (size == 0) return 0;

const skipValue = solve(n-1, size);
const item = items[n - 1];
let selectValue = skipValue
if (size >= item.size) {
selectValue = item.value + solve(n-1, size - item.size);
}

return Math.max(skipValue, selectValue);
}

return solve(items.length, sizeLimit);
}
Insert cell
knapsackR(ITEMS, 12)
Insert cell
knapsackR(ITEMS_15, 750)
Insert cell
knapsackR(ITEMS_24, 6404180)
Insert cell
function knapsackM(items, sizeLimit) {
const m = {}

function solve(n, size) {
if (n == 0) return 0;
if (size == 0) return 0;

const key = [n, size].join('-');
if (key in m) return m[key];

const skipValue = solve(n-1, size);
const item = items[n - 1];
let selectValue = skipValue
if (size >= item.size) {
selectValue = item.value + solve(n-1, size - item.size);
}

m[key] = Math.max(skipValue, selectValue);
return m[key];
}

return solve(items.length, sizeLimit);
}
Insert cell
knapsackM(ITEMS, 12)
Insert cell
knapsackM(ITEMS_15, 750)
Insert cell
Insert cell
function knapsackD(items, size) {
const n = items.length;
const m = new Array(n+1).fill(0)
.map(v => new Array(size+1).fill(0))

for (let i = 1; i <= n; i++) {
const item = items[i-1]
for (let j = 1; j <= size; j++) {
const skipValue = m[i-1][j]
const k = j - item.size
if (k < 0) {
m[i][j] = skipValue
} else {
const selectValue = m[i-1][k] + item.value
m[i][j] = Math.max(skipValue, selectValue)
}
}
}

return m[n][size]
}
Insert cell
knapsackD(ITEMS_15, 750)
Insert cell
knapsackD(ITEMS_24, 6404180)
Insert cell
Insert cell
function knapsackL(items, sizeLimit) {
let max = 0;
let stack = [[0, 0, 0]]
let node

while ((node = stack.pop())) {
const [j, value, size] = node;
if (size > sizeLimit) continue;
if (value > max) max = value;
if (j == items.length) continue;

stack.push([j+1, value, size]);
const item = items[j];
stack.push([j+1, value + item.value, size + item.size]);
}

return max;
}
Insert cell
knapsackL(ITEMS_15, 750)
Insert cell
knapsackL(ITEMS_24, 6404180)
Insert cell

One platform to build and deploy the best data apps

Experiment and prototype by building visualizations in live JavaScript notebooks. Collaborate with your team and decide which concepts to build out.
Use Observable Framework to build data apps locally. Use data loaders to build in any language or library, including Python, SQL, and R.
Seamlessly deploy to Observable. Test before you ship, use automatic deploy-on-commit, and ensure your projects are always up-to-date.
Learn more