1. HandoutLecture 9Sorting Networks Rearranging Trains BADC Stub or lead BADC Sorted order BADC Stub or lead Stack or LIFO data structure in CE BADC Stub or lead Question: Is there an ordering that cannot be sorted using a stub? Devising a sorting algorithm BADC Siding Queue or FIFO BADC Track Train cars Engine

2. HandoutLecture 9Sorting Networks Delivering Train Cars in a Specific Order 1 BADC 2 3 Cars in the train below have been sorted according to their delivery points. However, it is still nontrivial to deposit car A in stub 1, car B in stub 2, and car C in siding 3. Cars can be pulled or pushed by the engine. 1 2 3 1 2 3 Is there a better initial ordering of the cars for the deliveries in this puzzle?

3. HandoutLecture 9Sorting Networks Train Passing Puzzle The trains below must pass each other using a siding that can hold only one car or one engine. Show how this can be done. BA21

4. HandoutLecture 9Sorting Networks A 16-Input Sorting Network 5 10 8 12 6 14 2 7 4 15 9 1 11 13 3 0 Use 4-input sorters, follow by (4, 4)-mergers, and end with an (8, 8)-merger Using the 0-1 principle, we can validate this network via 16 + 25 + 81 tests 01230123 45674567 8 9 10 11 12 13 14 15 5 8 10 12 2 6 7 14 1 4 9 15 0 3 11 13 25672567 8 10 12 14 01340134 9 11 13 15 4-sorter tests(4, 4)-merger tests(8, 8)-merger tests