Source code online books for professionals by professionals

Table A1-1.  (continued)

---

259
Appendix B
List of Problems and Algorithms
If you’re having hull problems, I feel bad for you, son; I’ve got 99 problems, but a breach ain’t one.
— Anonymous
1
This appendix does not list every problem and algorithm mentioned in the book because some algorithms are 
discussed only to illustrate a principle and some problems serve only as examples for certain algorithms. The most 
important problems and algorithms, however, are sketched out here, with some references to the main text. If you’re 
unable to find what you’re looking for by consulting this appendix, take a look in the index.
In most descriptions in this appendix, n refers to the problem size (such as the number of elements in a sequence). 
For the special case of graphs, though, n refers to the number of nodes, and m refers to the number of edges.
Problems