下载掌阅APP，畅读海量书库
立即打开
[1] M. Abramowitz and I. Stegun. Handbook of Mathematical Functions , Dover, New York, 1972.
[2] A. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Algorithms , Addison-Wesley, Reading, MA, 1975.
[3] B. Char, K. Geddes, G. Gonnet, B. Leong, M. Monagan, and S. Watt. Maple V Library Reference Manual , Springer-Verlag, New York, 1991. Also Maple User Manual , Maplesoft, Waterloo, Ontario, 2012.
[4] J. Clément, J. A. Fill, P. Flajolet, and B. Valée.“The number of symbol comparisons in quicksort and quickselect,” 36th International colloquium on Automata , Languages , and Programming , 2009, 750-763.
[5] L. Comtet. Advanced Combinatorics , Reidel, Dordrecht, 1974.
[6] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms , 3rd edition, MIT Press, New York, 2009.
[7] S. Dasgupta, C. Papadimititriou, and U. Vazrani. Algorithms , McGraw-Hill, New York, 2008.
[8] M. Drmota. Random Trees: An Interplay Between Combinatorics and Probability , Springer Wien, New York, 2009.
[9] W. Feller. An Introduction to Probability Theory and Its Applications , John Wiley & Sons, New York, 1957.
[10] P. Flajolet and R. Sedgewick. Analytic Combinatorics , Cambridge University Press, 2009.
[11] G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures in Pascal and C , 2nd edition, Addison-Wesley, Reading, MA, 1991.
[12] R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics , 1st edition, Addison-Wesley, Reading, MA, 1989.2nd edition, 1994.
[13] D. H. Greene and D. E. Knuth.
Mathematics for the Analysis of Algorithms
, 3rd edition, Birkh
user, Boston, 1991.
[14] P. Henrici. Applied and Computational Complex Analysis , 3 volumes, John Wiley & Sons, New York, 1974(volume 1), 1977(volume 2), 1986(volume 3).
[15] C. A. R. Hoare.“Quicksort,” Computer Journal 5, 1962, 10-15.
[16] J. Kleinberg and E. Tardos. Algorithm Design , Addison-Wesley, Boston, 2005.
[17] D. E. Knuth. The Art of Computer Programming . Volume 1:Fundamental Algorithms , 1st edition, Addison- Wesley, Reading, MA, 1968.3rd edition, 1997.
[18] D. E. Knuth. The Art of Computer Programming . Volume 2:Seminumerical Algorithms , 1st edition, Addison- Wesley, Reading, MA, 1969.3rd edition, 1997.
[19] D. E. Knuth. The Art of Computer Programming. Volume 3:Sorting and Searching , 1st edition, Addison- Wesley, Reading, MA, 1973.2nd edition, 1998.
[20] D. E. Knuth. The Art of Computer Programming . Volume 4A:Combinatorial Algorithms, Part 1 , Addison- Wesley, Boston, 2011.
[21] D. E. Knuth.“Big omicron and big omega and big theta,” SIGACT News , April-June 1976, 18-24.
[22] D. E. Knuth.“Mathematical analysis of algorithms,” Information Processing 71 , Proceedings of the IFIP Congress, Ljubljana, 1971, 19-27.
[23] R. Motwani and P. Raghavan. Randomized Algorithms , Cambridge University Press, 1995.
[24] F. W. J. Olver, D. W. Lozier, R. F. Boisvert, and C. W. Clark, ed., NIST Handbook of Mathematical Functions , Cambridge University Press, 2010. Also accessible as Digital Library of Mathematical Functions http:// dlmf.nist.gov.
[25] M. O. Rabin.“Probabilistic algorithms,”in Algorithms and Complexity , J.F.Traub, ed., Academic Press, New York, 1976, 21-39.
[26] R. Sedgewick. Algorithms (3rd edition) in Java: Parts 1-4:Fundamentals, Data Structures, Sorting, and Searching , Addison-Wesley, Boston, 2003.
[27] R. Sedgewick. Quicksort , Garland Publishing, New York, 1980.
[28] R. Sedgewick.“Quicksort with equal keys,” SIAM Journal on Computing 6, 1977, 240-267.
[29] R. Sedgewick.“Implementing quicksort programs,” Communications of the ACM 21, 1978, 847-856.
[30] R. Sedgewick and K. Wayne. Algorithms , 4th edition, Addison-Wesley, Boston, 2011.
[31] N. Slonae and S. Plouffe. The Encyclopedia of Integer Sequences , Academic Press, San Diego, 1995.Also accessible as On-Line Encyclopedia of Integer Sequences , http://oeis.org.
[32] W. Szpankowski. Average-Case Analysis of Algorithms on Sequences , John Wiley & Sons, New York, 2001.
[33] E. Tufte. The Visual Display of Quantitative Information , Graphics Press, Chesire, CT, 1987.
[34] J. S. Vitter and P. Flajolet.“Analysis of algorithms and data structures,”in Handbook of Theoretical Computer Science A:Algorithms and Complexity , J.van Leeuwen, ed., Elsevier, Amsterdam, 1990, 431-524.
[35] E. W. Weisstein, ed., MathWorld .