aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJan Sucan <sucanjan@fit.cvut.cz>2019-10-01 16:28:27 +0200
committerJan Sucan <sucanjan@fit.cvut.cz>2019-10-01 16:28:27 +0200
commit49c80611acf4fde73ad292a7b67b5fd1066ef662 (patch)
tree971b056186dd7c79cc08d0fa8a17d830f729f681
parentaebf7f12cea84cbe80e62528daa8e1518b63886d (diff)
README.md: Fix typos
-rw-r--r--README.md8
1 files changed, 4 insertions, 4 deletions
diff --git a/README.md b/README.md
index 7adc86f..b8ebd9b 100644
--- a/README.md
+++ b/README.md
@@ -1,9 +1,9 @@
# knapsack-solver
This is command-line utility for solving 0/1 knapsack problem
-usingbranch-and-bound method, dynamic programming, simple heuristic
-(weight/price)and fully polynomial time approximation scheme. It can measure
-CPU andwall-clock time spent by solving a problem, compute relative error of
-theresult and generate graphs from those values.
+using branch-and-bound method, dynamic programming, simple heuristic
+(weight/price) and fully polynomial time approximation scheme. It can measure
+CPU and wall-clock time spent by solving a problem, compute relative error of
+the result and generate graphs from those values.
## Usage
Built-in usage information can be obtained by executing ```knapsack_solver```