Skip to main content

/Dynamic Programming/Knapsack 0/1

1 / 38

Speed

/

Big O Notation Recursion Two Pointers Sliding Window Space Complexity Worst-case Analysis Memoization Greedy vs DP

Stack Queue Linked List Hash Table Binary Search Tree Heap Union-Find / Disjoint Sets Red-Black Tree

Bubble Sort Selection Sort Insertion Sort Quick Sort Merge Sort Heap Sort Counting Sort Radix Sort Shell Sort Bucket Sort

Binary Search Linear Search Jump Search Interpolation Search Quickselect / Median Finding

Breadth-First Search Depth-First Search Dijkstra's Algorithm Prim's Algorithm Kruskal's MST Topological Sort

Fibonacci DP Knapsack 0/1 Longest Common Subsequence

N-Queens Problem Sudoku Solver Maze Pathfinding

Sieve of Eratosthenes

45 algorithms·by Sai Rithwik Kukunuri

Knapsack 0/1 — Dynamic Programming

Step 1:DP table initialized to 0. Rows = items (0..4), Cols = capacity (0..8).

Variables

weights==[2,3,4,5]

values==[3,4,5,6]

capacity==8