From 49c80611acf4fde73ad292a7b67b5fd1066ef662 Mon Sep 17 00:00:00 2001 From: Jan Sucan Date: Tue, 1 Oct 2019 16:28:27 +0200 Subject: README.md: Fix typos --- README.md | 8 ++++---- 1 file 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``` -- cgit v1.2.3