Question

The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________

(a) O(n)

(b) O(n2)

(c) O(n!)

(d) O(n/2)

The question was asked by my school principal while I was bunking the class.

The query is from Artificial Intelligence Algorithms in division Other AI Algorithms & Statistics of Artificial Intelligence

Answer 1

The correct option is (c) O(n!)

The explanation is: The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is O(n!).