Notes from lecture mar.01 through apr.14. Sketch the argument than comparison-based sorting of n items requires at least n log n comparisons. Jelly2000 assembly language, translating to machine language, the Jelly2000 CPU and its four-step cycle.
Starred items are more important than non-starred items.
Let n be the total number of cities. For optional fun Taking this problem further. Starting with the table of cities connected in one leg, we can compute the table of cities connected in up to two legs, and then the table of cities connected via up to four legs, then eight legs, sixteen legs, etc. The reduction is not difficult. Be sure to specify in which memory locations you want each of your program instructions stored.