Q305
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!)
AnswerD.
O(n/2)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board