Question

In the TSP problem of n cities, the time taken for traversing all cities, without having prior knowledge of the length of the minimum tour will be_______.

1. O(n)
2. O(n2)
3. O(n!)
4. O(n/2)

Answer 1

Answer: c. O(n!)

Explanation: In the TSP problem of n cities, the time taken for traversing all cities without having prior knowledge of the length of the minimum tour will be O(n!).