bibin/cphb
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

References etc.

Browse source
This commit is contained in:
Antti H S Laaksonen 2017-02-25 18:21:27 +02:00
parent ef1e3abfd1
commit 3b312e9caf
5 changed files with 22 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

2
chapter03.tex
View file

@ -326,7 +326,7 @@ of the algorithm is at least $O(n^2)$.
It is possible to sort an array efficiently
in $O(n \log n)$ time using algorithms
that are not limited to swapping consecutive elements.
One such algorithm is \key{mergesort}\footnote{According to \cite{knu98},
One such algorithm is \key{mergesort}\footnote{According to \cite{knu983},
mergesort was invented by J. von Neumann in 1945.}
that is based on recursion.