Discrete Algorithmic Mathematics, Third Edition PDF
Preview Discrete Algorithmic Mathematics, Third Edition
List of Algorithms This table lists all the numbered algorithms in the book. All algorithms displayed in boxes in the text are numbered, as well as the more important algorithms displayed in boxes in the problems. In addition, there are numerous algorithm fragments both in the text and in the problems. The fragments and unnumbered algorithms illustrate some point and are generally not important algorithms in themselves. Number Name Output or Purpose Page 1.1 PowerA Computes integer powers of a number 74 1.2 PowerB Speed-up of 1.1 for some powers 75 1.3 PowerC Speed-up of 1.1 75 1.4 PrimeNum First K prime numbers 77 1.5 FiberNet Minimum cost links in a network 80 1.6 Euclid Greatest common divisor (gcd) of two integers 84, 123, 170 1.7 Euclid1 Possibly faster variant of 1.6 87 1.8 Euclid-RecFunc Recursive function version of 1.6 96, 163 1.9 Euclid-RecPro Recursive procedure version of 1.6 97, 165 1.10 Hanoi Towers of Hanoi 101 1.11 StringProc Process a string of characters 109 1.12 MaxNumber Maximum of n numbers 119, 587 1.13 SeqSearch Sequential search of a list 125 1.14 BinSearch Binary search of a list 127, 172 1.15 Euclid2 Possibly faster variant of 1.6 132 2.1 Hanoi Slight rewrite of 1.10 160 2.2 TOH Variant recursive procedure for Hanoi 166 2.3 EuclidRound-Func Possibly faster variant of 1.8 167 2.4 EuclidRound-Pro Possibly faster variant of 1.9 167 2.5 Euclid-RoundUp Possibly faster variant of 1.6 167 2.6 Iterative-TOH Nonrecursive Towers of Hanoi 179 2.7 Sum-Search Find if one number is the sum of some others 213 2.8 EuclidZ Version of 1.6 that also works for negative integers 214 3.1 BuildTree Binary tree of a list of words 223 3.2 Warshall Path matrix of a graph 244 3.3 Pathgrow Grows a path in a graph 255 3.4 Ecycle An Eulerian cycle in a graph 256 Number Name Output or Purpose Page 3.5 HamPath A Hamiltonian path in a complete graph 261 3.6 Dijkstra Shortest path in a weighted graph 272 3.7 BreadthFirstSearch Breadth first search of a connected graph 279 3.8 PathLength Lengths of all paths from a given vertex 281 3.9 DepthFirstSearch Depth first search of a connected graph 282
Description:The list of books you might like
