c20-6 (779628), страница 4
Текст из файла (страница 4)
NOTE: The conversion routine, for this demonstrationonly, is a slow (∝ N 2 ) algorithm. Fast (∝ N ln N ), more complicated, radix conversionalgorithms do exist.s[m+3]=0;printf(" %64s\n",&s[1]);free_cvector(pi,1,n+1);free_cvector(s,1,3*n);free_cvector(t,1,n<<1);free_cvector(sxi,1,n);free_cvector(sx,1,n);free_cvector(y,1,n<<1);free_cvector(x,1,n+1);return;}20.6 Arithmetic at Arbitrary Precision925CITED REFERENCES AND FURTHER READING:Borwein, J.M., and Borwein, P.B. 1987, Pi and the AGM: A Study in Analytic Number Theoryand Computational Complexity (New York: Wiley). [1]Knuth, D.E.
1981, Seminumerical Algorithms, 2nd ed., vol. 2 of The Art of Computer Programming(Reading, MA: Addison-Wesley), §4.3. [2]Kolata, G. 1990, June 20, The New York Times. [4]Kronsjö, L. 1987, Algorithms: Their Complexity and Efficiency, 2nd ed. (New York: Wiley).Sample page from NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5)Copyright (C) 1988-1992 by Cambridge University Press.Programs Copyright (C) 1988-1992 by Numerical Recipes Software.Permission is granted for internet users to make one paper copy for their own personal use.
Further reproduction, or any copying of machinereadable files (including this one) to any servercomputer, is strictly prohibited. To order Numerical Recipes books,diskettes, or CDROMsvisit website http://www.nr.com or call 1-800-872-7423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America).Ramanujan, S. 1927, Collected Papers of Srinivasa Ramanujan, G.H. Hardy, P.V. Seshu Aiyar,and B.M. Wilson, eds.
(Cambridge, U.K.: Cambridge University Press), pp. 23–39. [3].
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
