TAOCP Vol 3: Sorting and Searching

Volume 3: Sorting and Searching. 945 solved, 302 verified, 943 total.

35 items

Volume 3: Sorting and Searching

Exercise solutions for TAOCP Volume 3. 945 solved, 302 verified, 943 total.

Section Title Solved Verified Total
5 Introduction to Sorting 25 23 25
5.1 Combinatorial Properties of Permutations 4 2 4
5.1.1 Inversions 29 24 29
5.1.2 Permutations of a Multiset 24 11 24
5.1.3 Runs 29 19 29
5.1.4 Tableaux and Involutions 44 24 44
5.2 Internal Sorting 13 5 13
5.2.1 Sorting by Insertion 37 8 37
5.2.2 Sorting by Exchanging 56 4 56
5.2.3 Sorting by Selection 38 13 38
5.2.4 Sorting by Merging 23 5 23
5.2.5 Sorting by Distribution 18 6 18
5.3.1 Minimum-Comparison Sorting 36 5 36
5.3.2 Minimum-Comparison Merging 21 10 21
5.3.3 Minimum-Comparison Selection 27 4 27
5.3.4 Networks for Sorting 68 2 68
5.4 External Sorting 4 0 4
5.4.1 Multiway Merging and Replacement Selection 28 11 28
5.4.2 The Polyphase Merge 31 6 31
5.4.3 The Cascade Merge 11 3 11
5.4.4 Reading Tape Backwards 22 0 22
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 7 1 7
5.4.8 Two-Tape Sorting 10 3 10
5.4.9 Disks and Drums 31 4 31
5.5 Summary, History, and Bibliography 6 4 4
6.1 Sequential Searching 22 9 22
6.2.1 Searching an Ordered Table 30 12 30
6.2.2 Binary Tree Searching 49 20 49
6.2.3 Balanced Trees 33 8 33
6.2.4 Multiway Trees 10 2 10
6.3 Digital Searching 45 19 45
6.4 Hashing 78 25 78
6.5 Retrieval on Secondary Keys 20 7 20