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

New references etc.

Browse source
This commit is contained in:
Antti H S Laaksonen 2017-02-25 16:51:29 +02:00
parent 702f5ac9c3
commit c18f6a808f
9 changed files with 61 additions and 132 deletions
Download patch file Download diff file Expand all files Collapse all files

3
chapter03.tex
View file

@ -326,7 +326,8 @@ 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}
One such algorithm is \key{mergesort}\footnote{According to \cite{knu98},
mergesort was invented by J. von Neumann in 1945.}
that is based on recursion.
Mergesort sorts a subarray \texttt{t}$[a,b]$ as follows: