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
1. O(n)
2. O(n2)
3. O(n!)
4. O(n/2)
Answer :
3 - O(n!)
|