Saake, G. & Sattler, K.-U.: Saake, G. & Sattler, K.-U. (Hrsg.): Algorithmen und Datenstrukturen: Eine Einführung mit Java. dpunkt.verlag Heidelberg, 2010 (4)
@book{SaakeCode2006,
author = {Saake, Gunter and Sattler, Kai-Uwe},
title = {Algorithmen und Datenstrukturen: Eine Einführung mit Java},
editor = {Saake, Gunter and Sattler, Kai-Uwe},
publisher = {dpunkt.verlag Heidelberg},
year = {2010},
volume = {4},
keywords = {2011, algorithm, implementation, kde, saake, sattler, seminar, sorting}
}
Gruber, H.; Holzer, M. & Ruepp, O.: Sorting the slow way: an analysis of perversely awful randomized sorting algorithms. Proceedings of the 4th international conference on Fun with algorithms. Berlin, Heidelberg: Springer-Verlag, 2007FUN'07 , S. 183-197
[Volltext]
This paper is devoted to the "Discovery of Slowness." The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with elementary methods. Moreover, practical experiments are performed.
@inproceedings{Gruber:2007:SSW:1760607.1760624,
author = {Gruber, Hermann and Holzer, Markus and Ruepp, Oliver},
title = {Sorting the slow way: an analysis of perversely awful randomized sorting algorithms},
booktitle = {Proceedings of the 4th international conference on Fun with algorithms},
series = {FUN'07},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
year = {2007},
pages = {183--197},
url = {http://portal.acm.org/citation.cfm?id=1760607.1760624},
isbn = {978-3-540-72913-6},
keywords = {2011, algorithms, kde, seminar, slow, sorting},
abstract = {This paper is devoted to the "Discovery of Slowness." The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with elementary methods. Moreover, practical experiments are performed.}
}
Knuth, D. E.: Knuth, D.~E. (Hrsg.): Sorting and searching.. Sorting and searching. 1973 (The art of computer programming. 3)
@book{{knuth}1973computer,
author = {Knuth, D. E.},
title = {Sorting and searching.},
editor = {Knuth, D.~E.},
booktitle = {Sorting and searching},
series = {The art of computer programming.},
year = {1973},
volume = {3},
keywords = {2011, art, computer, kde, programming, seminar, sorting, vol3}
}
Knuth, D. E.: Knuth, D.~E. (Hrsg.): The art of computer programming. Vol.3: Sorting and searching. Atmospheric Chemistry & Physics. 1973
@book{1973acp..book.....K,
author = {Knuth, D. E.},
title = {The art of computer programming. Vol.3: Sorting and searching},
editor = {Knuth, D.~E.},
booktitle = {Atmospheric Chemistry & Physics},
year = {1973},
keywords = {2011, kde, seminar, sorting}
}
Martin, W. A.: Sorting. In: ACM Comput. Surv. 3 (1971), S. 147-174
[Volltext]
@article{Martin:1971:SOR:356593.356594,
author = {Martin, W. A.},
title = {Sorting},
journal = {ACM Comput. Surv.},
publisher = {ACM},
address = {New York, NY, USA},
year = {1971},
volume = {3},
pages = {147--174},
url = {http://doi.acm.org/10.1145/356593.356594},
doi = {http://doi.acm.org/10.1145/356593.356594},
keywords = {2011, kde, seminar, sorting}
}
Hoare, C. A. R.: Quicksort. In: The Computer Journal 5 (1962), Nr. 1, S. 10-16
[Volltext]
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.
@article{Quicksort,
author = {Hoare, C. A. R.},
title = {Quicksort},
journal = {The Computer Journal},
year = {1962},
volume = {5},
number = {1},
pages = {10-16},
url = {http://comjnl.oxfordjournals.org/cgi/content/abstract/5/1/10},
doi = {10.1093/comjnl/5.1.10},
keywords = {algorithm, kde, quicksort, seminar, sorting},
abstract = {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.
}
}