The first revision of this third volume is the most comprehensive survey of classical computer techniques
for sorting and searching. It extends the treatment of
data structures in Volume 1 to consider both large and
small databases and internal and external memories.

    The book contains a selection of carefully checked
computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition
include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.

Chapter 1 – Basic Concepts
1.3 MMIX
1.3.1 Description of MMIX
1.3.2 The MMIX Assembly Language
1.3.3 Applications to Permutations
1.4 Some Fundamental Programming Techniques
1.4.1 Subroutines
1.4.2 Coroutines
1.4.3 Interpretive Routines
Answers to Exercises