Unformatted text preview: 5 3,4 5 4 2 2,3 2,3,4,5 Solutions to Exercises (c) [BB] The lists 1,3,5 and 2,4,6 can be merged with 3 + 3  1 = 5 comparisons . .c 1 .c 2 .c 3 1,3,5 3,5 3,5 5 5 2,4,6 2,4,6 1 4,6 1,2 4,6 6 1,2,3 1,2,3,4 1,2,3,4,5,6 11. Two such lists are 1,2,3,4 and 5, and here's why . .c 1 .c 2 .c 3 1,2,3,4 5 2,3,4 5 3,4 5 4 5 1 1,2 1,2,3 1,2,3,4,5 12. To merge two given sorted lists of lengths s and t, into a single sorted list of length s + t, proceed as follows....
View
Full
Document
This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.
 Summer '10
 any
 Graph Theory

Click to edit the document details