O'Reilly logo

Algorithms in a Nutshell by Gary Pollice, Stanley Selkow, George T. Heineman

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

References

Bentley, Jon Louis and M. Douglas McIlroy, "Engineering a Sort Function," Software—Practice and Experience, 23(11): 1249–1265, 1993, http://citeseer.ist.psu.edu/bentley93engineering.html.

Blum, Manuel, Robert Floyd, Vaughan Pratt, Ronald Rivest, and Robert Tarjan, "Time bounds for selection." Journal of Computer and System Sciences, 7(4): 448–461, 1973.

Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, Second Edition. McGraw-Hill, 2001.

Davis, Mark and Ken Whistler, "Unicode Collation Algorithm, Unicode Technical Standard #10," March 2008, http://unicode.org/reports/tr10/.

Gilreath, William, "Hash sort: A linear time complexity multiple-dimensional sort algorithm." Proceedings of First Southern Symposium on Computing, December 1998, http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0408040=oai:arXiv.org:cs/0408040.

Musser, David, "Introspective sorting and selection algorithms." Software—Practice and Experience, 27(8): 983–993, 1997.

Sedgewick, Robert, "Implementing Quicksort Programs." Communications ACM, 21: 847–857, 1978.

Trivedi, Kishor Shridharbhai, Probability and Statistics with Reliability, Queueing, and Computer Science Applications, Second Edition. Wiley-Interscience Publishing, 2001.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required