Suppose we were faced with solving the
traveling salesman problem in a context
involving 15 cities in which any two cities
were connected by a unique road. How
many different paths through the cities
would there be? How long would it take to
compute the length of all of these paths
assuming that the length of a path can be
computed in one microsecond?
Q370: How many comparisons between names are
made if the merge sort algorithm (Figures 12.9
and 12.8) is applied to the list Alice, Bob, Carol,
and David? How many are required if the list
is Alice, Bob, Carol, David, and Elaine?