Update src/dynamic_programming/knapsack.md

OverRancid · adamant-pwn · web-flow · commit 29fe30bd2155 · 2024-06-09T16:07:21.000+05:30
Co-authored-by: Oleksandr Kulkov &lt;adamant.pwn@gmail.com&gt;
diff --git a/src/dynamic_programming/knapsack.md b/src/dynamic_programming/knapsack.md
@@ -13,7 +13,7 @@ Consider the following example:
 There are $n$ distinct items and a knapsack of capacity $W$. Each item has 2 attributes, weight ($w_{i}$) and value ($v_{i}$). 
 You have to select a subset of items to put into the knapsack such that the total weight does not exceed the capacity $W$ and the total value is maximized.
 
-In the above example, since each object has only two possible states (taken or not taken),
+In the example above, since each object has only two possible states (taken or not taken),
 correspoding to binary 0 and 1, this type of problem is called "0-1 knapsack problem".
 
 ## 0-1 Knapsack
