From 1c63dec8d0b995c292f5fd17e1b6ba32e678ab68 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Sat, 25 Feb 2017 12:47:24 +0200
Subject: [PATCH] Counting sort complexity [closes #11]

---
 chapter03.tex | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/chapter03.tex b/chapter03.tex
index 8a64d06..7d834ae 100644
--- a/chapter03.tex
+++ b/chapter03.tex
@@ -538,8 +538,7 @@ but use some other information.
 An example of such an algorithm is
 \key{counting sort} that sorts an array in
 $O(n)$ time assuming that every element in the array
-is an integer between $0 \ldots c$ where $c$
-is a small constant.
+is an integer between $0 \ldots c$ and $c=O(n)$.
 
 The algorithm creates a \emph{bookkeeping} array
 whose indices are elements in the original array.