From d552050f7ec7bfaf6f27be18c5f6ec91a67fd84f Mon Sep 17 00:00:00 2001 From: onyx-and-iris Date: Fri, 19 Jan 2024 17:23:09 +0000 Subject: [PATCH] typo --- chapter11/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/chapter11/README.md b/chapter11/README.md index d348b66..162626f 100644 --- a/chapter11/README.md +++ b/chapter11/README.md @@ -3,4 +3,4 @@ A programming technique for decomposing a problem into smaller discrete subproblems. - Useful when trying to optimize something given a constraint. - - Example, items in a knapsack of size W that gives the greates value. + - Example, items in a knapsack of size W that gives the greatest value.