@article{234321, address = {New York, NY, USA}, author = {Reingold, Edward M.}, doi = {10.1145/234313.234321}, interhash = {cc45bd5ed73a6bb48672e745605c2045}, intrahash = {52d6ea9e967cebb8a805057d8cd0f685}, issn = {0360-0300}, journal = {ACM Comput. Surv.}, number = 1, pages = {19--21}, publisher = {ACM}, title = {Basic techniques for design and analysis of algorithms}, url = {http://portal.acm.org/citation.cfm?id=234313.234321&coll=Portal&dl=GUIDE&CFID=88775871&CFTOKEN=40392553}, volume = 28, year = 1996 } @article{356594, abstract = {The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples. As the algorithms are explained, references to related algorithms and mathematical or experimental analyses are given. Suggestions are then made for choosing the algorithm best suited to a given situation.}, address = {New York, NY, USA}, author = {Martin, W. A.}, doi = {10.1145/356593.356594}, interhash = {1bed8163f826eb4d7631c9135f9aaf8a}, intrahash = {935269dff6cce683c61c9086662e136d}, issn = {0360-0300}, journal = {ACM Comput. Surv.}, number = 4, pages = {147--174}, publisher = {ACM}, title = {Sorting}, url = {http://portal.acm.org/citation.cfm?id=356593.356594&coll=Portal&dl=GUIDE&CFID=89172762&CFTOKEN=95662085}, volume = 3, year = 1971 } @article{journals/cacm/Pohl72, author = {Pohl, Ira}, ee = {http://doi.acm.org/10.1145/361405.361423}, interhash = {e416f828bdb17572e992e2afc6e5c3b0}, intrahash = {bd02d51c6007ff442d76dd9ec005be91}, journal = {Commun. ACM}, number = 6, pages = {462-464}, title = {A Sorting Problem and Its Complexity.}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Pohl72}, volume = 15, year = 1972 } @article{hoare1961algorithm, author = {Hoare, C. A. R.}, ee = {http://doi.acm.org/10.1145/366622.366644}, interhash = {bd42d51836f956e2deebeb10b8e5f93a}, intrahash = {1b58ff39c1c545c2be8114935d3c757d}, journal = {Commun. ACM}, number = 7, pages = 321, title = {Algorithm 64: Quicksort.}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, volume = 4, year = 1961 } @article{Floyd64a, author = {Floyd, Robert W.}, ee = {http://doi.acm.org/10.1145/355588.365103}, interhash = {d7468ef11591a6c9e607d43428e2d69d}, intrahash = {c25787586d5cf013bb10f2e67b167820}, journal = {Commun. ACM}, number = 12, pages = 701, title = {Algorithm 245: Treesort.}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm7.html#Floyd64a}, volume = 7, year = 1964 } @article{williams1964algorithm, author = {Williams, J. W. J.}, interhash = {88f7b4bad2300e0db2fab61c269e1f4e}, intrahash = {f485e4ea9a877871b59ab503151a7f10}, journal = {Communications of the ACM}, number = 6, pages = {347–348}, title = {Algorithm 232: Heapsort}, volume = 7, year = 1964 } @article{journals/cacm/Sedgewick78, author = {Sedgewick, Robert}, ee = {http://doi.acm.org/10.1145/359619.359631}, interhash = {9a4a22f5ef011caa82c52462824cf636}, intrahash = {6bb82a1159e0686feee71b28976c7f12}, journal = {Commun. ACM}, note = {Corrigendum: CACM 22(6): 368 (1979)}, number = 10, pages = {847-857}, title = {Implementing Quicksort Programs.}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#Sedgewick78}, volume = 21, year = 1978 } @article{journals/jacm/Flores61, author = {Flores, Ivan}, ee = {http://doi.acm.org/10.1145/321052.321055}, interhash = {165673c48e6ac130f1536326c8787818}, intrahash = {9b13510df8e5f3d28dcd8a277a8f29ed}, journal = {J. ACM}, number = 1, pages = {41-80}, title = {Analysis of Internal Computer Sorting.}, url = {http://dblp.uni-trier.de/db/journals/jacm/jacm8.html#Flores61}, volume = 8, year = 1961 } @article{Musser:1997:ISS:261387.261395, acmid = {261395}, address = {New York, NY, USA}, author = {Musser, David R.}, doi = {10.1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-\#}, interhash = {e2eb9a859abb44066bb771e742225e8a}, intrahash = {2a7233c1bb07caed5327314447ca90d0}, issn = {0038-0644}, issue_date = {Aug. 1997}, journal = {Softw. Pract. Exper.}, month = aug, number = 8, numpages = {11}, pages = {983--993}, publisher = {John Wiley \& Sons, Inc.}, title = {Introspective sorting and selection algorithms}, url = {http://dx.doi.org/10.1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-\#}, volume = 27, year = 1997 } @article{Schaffer:1993:AH:159277.159281, acmid = {159281}, address = {Duluth, MN, USA}, author = {Schaffer, Russel and Sedgewick, Robert}, doi = {10.1006/jagm.1993.1031}, interhash = {40b92ad6147010e002ad4bdf6eaf0e7b}, intrahash = {124caf5581da878730d8b76a362eb964}, issn = {0196-6774}, issue_date = {July 1993}, journal = {J. Algorithms}, month = jul, number = 1, numpages = {25}, pages = {76--100}, publisher = {Academic Press, Inc.}, title = {The analysis of heapsort}, url = {http://dx.doi.org/10.1006/jagm.1993.1031}, volume = 15, year = 1993 } @book{cormen2009introduction, address = {Cambridge, Masachusetts; London}, author = {Cormen, Thomas H.}, interhash = {86b7dad77ef9ceaf383d3b1391e5afbe}, intrahash = {b3558d43184a025c68dd67e7594c8fe5}, isbn = {9780262033848 0262033844 9780262533058 0262533057}, publisher = {The MIT Press}, refid = {804320768}, title = {Introduction to algorithms}, url = {http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844}, year = 2009 } @article{goldstine1947planning, author = {Goldstine, Hermann H. and von Neumann, John}, interhash = {b531c89166b50c434a2a235dd7453f0b}, intrahash = {ac578c88bf9c424f09eae1a74456e8de}, title = {PLANNING AND CODING OF PROBLEMS FOR AN ELECTRONIC COMPUTING INSTRUMENT}, year = 1947 } @book{books/aw/Knuth73, author = {Knuth, Donald E.}, interhash = {c59d8c8340baf8279da3d0114e3f3a98}, intrahash = {783324c23234081544e2ccbcb05a19e7}, isbn = {0-201-03803-X}, publisher = {Addison-Wesley}, title = {The Art of Computer Programming, Volume III: Sorting and Searching}, year = 1973 }