Permutations can be expressed in a variety of equivalent ways in a variety of applications. Bona (mathematics, U. of Florida) gathers together the scattered resources on both the enumerative and extremal combinatories of permutations. Bona's first chapter topics include permutations as linear orders in runs and inversions, and as products of cycles. He then examines pattern avoidance, random permutations, algebraic combinatories, and combinational sorting algorithms. He includes a description of the Stanley-Wilf conjecture and the recent Marcus-Tardos proof. Each chapter includes exercises and problems, with an answer key entitled "Do Not Look Just Yet."