next up previous contents index Search
Next: 0.1.4 Example Code Up: 0.1 Introduction Previous: 0.1.2 What needs work

0.1.3 Conventions

Algorithms here discussed are broken down into what I believe to be a logical outline. Each algorithm presented is first discussed at a conceptual level. Where appropriate an analysis of the complexity of an algorithm usually follows. Finally, in most cases, an implementation concludes the section dealing with a particular algorithm.

Words in boldface are key ideas or terms. These are also, generally, the words included in the document's index. Words in terminal type are either system commands or source code.

Scott Gasch