TAOCP Vol 3: Sorting and Searching

Volume 3: Sorting and Searching. 534 solved, 222 verified, 904 total.

33 items

Volume 3: Sorting and Searching

Exercise solutions for TAOCP Volume 3. 534 solved, 222 verified, 904 total.

Section Title Solved Verified Total
5 Introduction to Sorting 5 4 21
5.1 Combinatorial Properties of Permutations 4 2 30
5.1.1 Inversions 4 2 30
5.1.2 Permutations of a Multiset 11 5 26
5.1.3 Runs 14 8 24
5.1.4 Tableaux and Involutions 12 6 45
5.2 Internal Sorting 5 1 18
5.2.1 Sorting by Insertion 14 8 30
5.2.2 Sorting by Exchanging 7 4 63
5.2.3 Sorting by Selection 15 13 44
5.2.4 Sorting by Merging 8 5 27
5.2.5 Sorting by Distribution 9 6 21
5.3.1 Minimum-Comparison Sorting 8 5 29
5.3.2 Minimum-Comparison Merging 20 10 22
5.3.3 Minimum-Comparison Selection 16 4 31
5.3.4 Networks for Sorting 6 2 66
5.4.1 Multiway Merging and Replacement Selection 27 11 27
5.4.2 The Polyphase Merge 30 6 30
5.4.3 The Cascade Merge 11 3 11
5.4.5 The Oscillating Sort 2 0 2
5.4.6 Practical Considerations for Tape Merging 14 3 14
5.4.7 External Radix Sorting 6 1 6
5.4.8 Two-Tape Sorting 8 3 8
5.4.9 Disks and Drums 23 4 23
5.5 Summary, History, and Bibliography 5 4 5
6.1 Sequential Searching 16 9 16
6.2.1 Searching an Ordered Table 29 12 29
6.2.2 Binary Tree Searching 46 20 46
6.2.3 Balanced Trees 33 8 33
6.2.4 Multiway Trees 9 2 9
6.3 Digital Searching 40 19 40
6.4 Hashing 62 25 62
6.5 Retrieval on Secondary Keys 15 7 16