From 43312caa92a9124ff7eb698dc7561eba454c1c43 Mon Sep 17 00:00:00 2001 From: Antti H S Laaksonen Date: Thu, 25 May 2017 23:18:49 +0300 Subject: [PATCH] Small fixes --- chapter06.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/chapter06.tex b/chapter06.tex index a4a13f7..0bb1482 100644 --- a/chapter06.tex +++ b/chapter06.tex @@ -28,7 +28,7 @@ where we are given a set of coins and our task is to form a sum of money $n$ using the coins. The values of the coins are -$\{c_1,c_2,\ldots,c_k\}$, +$\texttt{coins}=\{c_1,c_2,\ldots,c_k\}$, and each coin can be used as many times we want. What is the minimum number of coins needed? @@ -120,7 +120,7 @@ Many scheduling problems can be solved using greedy algorithms. A classic problem is as follows: Given $n$ events with their starting and ending -times, our goal is to plan a schedule +times, find a schedule that includes as many events as possible. It is not possible to select an event partially. For example, consider the following events: