Source code online books for professionals by professionals

Dependencies. The prereqs for CPSC 357, the class on package management, are CPSC 432, CPSC 357, and glibc2.5 or 
later (
http://xkcd.com/754
)
Stronger Assumptions
The default induction hypothesis when designing algorithm is “We can solve smaller instances with this,” but sometimes 
that isn’t enough to actually perform the induction step or to perform it efficiently. Choosing the order of the subproblems 
can be important (such as in topological sorting), but sometimes we must actually make a stronger assumption to 
piggyback some extra information on our induction. Although a stronger assumption might seem to make the proof 
harder,
14
 it actually just gives us more to work with when deducing the step from n–1 (or n/2, or some other size) to n.
Consider the idea of balance factors. These are used in some types of balanced trees (discussed in Chapter 6) and 
are a measure of how balanced (or unbalanced) a tree or subtree is. For simplicity, we assume that each internal node 
has two children. (In an actual implementation, some of the leaves might simply be None or the like.) A balance factor 
is defined for each internal node and is set to the difference between the heights of the left and right subtrees, where 
height is the greatest distance from the node (downward) to a leaf. For example, the left child of the root in Figure 
4-6
 
has a balance factor of –2 because its left subtree is a leaf (with a height of 0), while its right child has a height of 2.