APPENDIX

permutation combinationToPermutation (combination c)

Returns the increasing n-permutation of c, where n is the cardinal of c.

integer intercityDistance (integer i, integer j)

Returns the distance between the two cities Ci and Cj.

.... Consider n+1 cities Co, C1, C2, ..., Cn, where n is a positive integer. A salesman must visit C1, C2, Cn. In which order should he visit these cities to minimize total travelled distance, knowing that he must start his journey from Co and end it in Co? To answer this question, write in pseudocode the procedure: void printitinerary (integer n). Use the library provided in Appendix