This volume comprises Chapters 5 and 6 of the complete series. Chapter 5is concerned with sorting into order; this is a large subject that hasbeen divided chiefly into two parts, internal sorting and externalsorting. There also are supplementary sections, which develop auxiliarytheories about permutations (Section 5.1) and about optimum techniquesfor sorting (Section 5.3). Chapter 6 deals with the problem of searchingfor specified items in tables or files; this is subdivided into methodsthat search sequentially, or by comparison of keys, or by digitalproperties, or by hashing, and then the more difficult problem ofsecondary key retrieval is considered. There searching related tosorting is a surprising amount of interplay between both chapters, withstrong analogies tying the topics together. Two important varieties ofinformation structures are also discussed, in addition to thoseconsidered in Chapter 2, namely priority queues (Section 5.2.3) andlinear lists represented as balanced trees (Section 6.2.3).