The Student Room Group

physics

A computer program takes 0.00075 seconds to calculate the best route between five cities using a brute-force approach to the travelling salesman problem. How long, to the nearest second, will it take to calculate the best route for ten cities?
Original post by flubbsy1990
A computer program takes 0.00075 seconds to calculate the best route between five cities using a brute-force approach to the travelling salesman problem. How long, to the nearest second, will it take to calculate the best route for ten cities.

You haven't told us what you are stuck on or what theory you know that might help here.
Also, this isn't really a physics problem.
But
How about working out how many ways you can arrange 5 objects.
Then how many ways you can arrange 10.
Can you do that? Have you studied permutations and combinations in maths/stats?
I'm assuming here that the starting city isn't already decided. Otherwise it would be 4 and 9 in the above suggestion.

Quick Reply

Latest