%0 
%0 Book
%A Cormen, Thomas H.
%D 2009
%T Introduction to algorithms
%E 
%B 
%C Cambridge, Masachusetts; London
%I The MIT Press
%V 
%6
%N 
%P
%& 
%Y 
%S 
%7 
%8 
%9
%? 
%! 
%Z 
%@ 9780262033848 0262033844 9780262533058 0262533057
%(
%)
%*
%L
%M
%1 
%2 Introduction to Algorithms: Amazon.de: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Englische Bücher
%3 book
%4 
%# 
%$ 
%F Cormen2009
%K 2013, algorithmen, algorithms, kde, quicksort, seminar, sorting
%X 
%Z 
%U http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844
%+
%^

%0 
%0 Journal Article
%A Bron, Coenraad
%D 1974
%T Merge Sort Algorithm (Remark on Algorithm 426).
%E 
%B Commun. ACM
%C 
%I 
%V 17
%6
%N 12
%P 706
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 article
%4 
%# 
%$ 
%F Bron1974
%K algorithmen, computer, mergesort, quicksort, sorting
%X 
%Z 
%U http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Bron74
%+
%^

%0 
%0 Journal Article
%A Hoare, C. A. R.
%D 1962
%T Quicksort
%E 
%B The Computer Journal
%C 
%I 
%V 5
%6
%N 1
%P 10-16
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 article
%4 
%# 
%$ 
%F Hoare01011962
%K algorithmen, komplexität, laufzeit, mergesort, quicksort
%X A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper.
%Z 
%U http://comjnl.oxfordjournals.org/content/5/1/10.abstract
%+
%^

%0 
%0 Journal Article
%A Hoare, C. A. R.
%D 1961
%T Algorithm 64: Quicksort.
%E 
%B Commun. ACM
%C 
%I 
%V 4
%6
%N 7
%P 321
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 dblp
%3 article
%4 
%# 
%$ 
%F Hoare1961
%K 2013, algorithmen, kde, quicksort, seminar, sorting
%X 
%Z 
%U http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b
%+
%^