xxii Computer Programs by Chapter and Section 7.1 ran2 random deviate by L'Ecuyer long period plus shuffle 7.1 ran3 random deviate by Knuth subtractive method 7.2 expdev exponential random deviates 7.2 gasdev normally distributed random deviates 7.3 gamdev gamma-law distribution random deviates 7.3 poidev Poisson distributed random deviates 7.3 bnldev binomial distributed random deviates 7.4 irbit1 random bit sequence 7.4 irbit2 random bit sequence readable files Permission is Sample page 7.5 psdes “pseudo-DES”hashing of64bits 7.5 ran4 random deviates from DES-like hashing 7.7 sobseq Sobol's quasi-random sequence (including this one) granted fori 7.8 vegas adaptive multidimensional Monte Carlo integration 7.8 rebin sample rebinning used by vegas internet 7.8 miser recursive multidimensional Monte Carlo integration 7.8 ranpt get random point,used by miser 8.1 piksrt sort an array by straight insertion http://www.nr.com or call 1-800-872-7423 (North America 8.1 piksr2 sort two arrays by straight insertion 8.1 shell sort an array by Shell's method 8.2 sort sort an array by quicksort method 8.2 sort2 sort two arrays by quicksort method 8.3 hpsort sort an array by heapsort method 8.4 indexx construct an index for an array to any server computer,is strictly prohibited. t users to make one paper copy for their 8.4 sort3 sort,use an index to sort 3 or more arrays 8.4 rank construct a rank table for an array 8.5 select find the Nth largest in an array 8.5 selip find the Nth largest,without altering an array 8.5 hpsel find M largest values,without altering an array 8.6 eclass determine equivalence classes from list personal use.Further reproduction,or Copyright (C)1988-1992 by Cambridge University Press.Programs Copyright(C)1988-1992 by Numerical Recipes from NUMERICAL RECIPES IN C:THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5) 8.6 eclazz determine equivalence classes from procedure 9.0 scrsho graph a function to search for roots 9.1 zbrac outward search for brackets on roots 9.1 zbrak inward search for brackets on roots 9.1 rtbis find root of a function by bisection 9.2 rtflsp find root of a function by false-position only),orsend email to directcustserv@cambridge.org(outside North America). 92 rtsec find root of a function by secant method Software. 9.2 zriddr find root of a function by Ridders'method 9.3 zbrent find root of a function by Brent's method 9.4 rtnewt find root of a function by Newton-Raphson ying of machine 9.4 rtsafe find root of a function by Newton-Raphson and bisection 9.5 laguer find a root of a polynomial by Laguerre's method 95 zroots roots of a polynomial by Laguerre's method with deflation 9.5 zrhqr roots of a polynomial by eigenvalue methods 9.5 qroot complex or double root of a polynomial,Bairstowxxii Computer Programs by Chapter and Section Permission is granted for internet users to make one paper copy for their own personal use. Further reproduction, or any copyin Copyright (C) 1988-1992 by Cambridge University Press. Programs Copyright (C) 1988-1992 by Numerical Recipes Software. Sample page from NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5) g of machine￾readable files (including this one) to any server computer, is strictly prohibited. To order Numerical Recipes books or CDROMs, visit website http://www.nr.com or call 1-800-872-7423 (North America only), or send email to directcustserv@cambridge.org (outside North America). 7.1 ran2 random deviate by L’Ecuyer long period plus shuffle 7.1 ran3 random deviate by Knuth subtractive method 7.2 expdev exponential random deviates 7.2 gasdev normally distributed random deviates 7.3 gamdev gamma-law distribution random deviates 7.3 poidev Poisson distributed random deviates 7.3 bnldev binomial distributed random deviates 7.4 irbit1 random bit sequence 7.4 irbit2 random bit sequence 7.5 psdes “pseudo-DES” hashing of 64 bits 7.5 ran4 random deviates from DES-like hashing 7.7 sobseq Sobol’s quasi-random sequence 7.8 vegas adaptive multidimensional Monte Carlo integration 7.8 rebin sample rebinning used by vegas 7.8 miser recursive multidimensional Monte Carlo integration 7.8 ranpt get random point, used by miser 8.1 piksrt sort an array by straight insertion 8.1 piksr2 sort two arrays by straight insertion 8.1 shell sort an array by Shell’s method 8.2 sort sort an array by quicksort method 8.2 sort2 sort two arrays by quicksort method 8.3 hpsort sort an array by heapsort method 8.4 indexx construct an index for an array 8.4 sort3 sort, use an index to sort 3 or more arrays 8.4 rank construct a rank table for an array 8.5 select find the Nth largest in an array 8.5 selip find the Nth largest, without altering an array 8.5 hpsel find M largest values, without altering an array 8.6 eclass determine equivalence classes from list 8.6 eclazz determine equivalence classes from procedure 9.0 scrsho graph a function to search for roots 9.1 zbrac outward search for brackets on roots 9.1 zbrak inward search for brackets on roots 9.1 rtbis find root of a function by bisection 9.2 rtflsp find root of a function by false-position 9.2 rtsec find root of a function by secant method 9.2 zriddr find root of a function by Ridders’ method 9.3 zbrent find root of a function by Brent’s method 9.4 rtnewt find root of a function by Newton-Raphson 9.4 rtsafe find root of a function by Newton-Raphson and bisection 9.5 laguer find a root of a polynomial by Laguerre’s method 9.5 zroots roots of a polynomial by Laguerre’s method with deflation 9.5 zrhqr roots of a polynomial by eigenvalue methods 9.5 qroot complex or double root of a polynomial, Bairstow