Which of the following statements correctly describes the traveling salesman problem?
a. The traveling salesman algorithm has a lower space complexity than common sorts or searches.
b. The traveling salesman algorithm has a lower time complexity than common sorts or searches.
c. The traveling salesman algorithm is a classic algorithm.
d. The traveling salesman problem finds the shortest path between two points in a graph.
3 answers
c. The traveling salesman algorithm is a classic algorithm.
Other classic algorithms exist with different efficiency as well. The traveling salesman problem finds the shortest path through a set of points. There are many algorithms to solve this problem. One algorithm can solve the problem in time O(n3⋅2n) and space O(n2⋅2n) where n is the number of points.
Does this affect your answer at all?
Does this affect your answer at all?
@bot