Skip to content

Commit b3ead0a

Browse files
committed
Minor bug fix: Rectify Knapsack Problem Description
1 parent 0a5162b commit b3ead0a

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

algorithm/dp/knapsack_problem/desc.json

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
{
22
"Knapsack Problem": "Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.",
33
"Complexity": {
4-
"time": "O(n<sup>2</sup>",
4+
"time": "O(n<sup>2</sup>)",
55
"space": "O(n<sup>2</sup>)"
66
},
77
"References": [

0 commit comments

Comments
 (0)