  Many algorithms for inserting elements into tableaux are known, starting with
the Robinson-Schensted algorithm. Much of those processes can be incorporated
into the general framework of Fomin's "growth diagrams". Even for single types
of tableaux, there are various alternative insertion algorithms and, due to the
varying ways they are described, the relationships between the algorithms can
be obscure. The distinguishing features of many algorithms can be codified into
graphic "insertion diagrams" which make important aspects of the algorithms
immediately apparent. We use insertion diagrams to build a graphic catalog or
picture book of many of the tableau insertion algorithms in the literature.
