ool Computer Science A

UNIT $3$

LESSON $5$

Data Structures and Algorithms

Algorithms

Algorithms Quick Check

Which of the following statements correctly describes the traveling salesman problem? $(1$ point$)$

The traveling salesman algorithm has a lower time complexity than common sorts or searches.

The traveling salesman problem finds the shortest path between two points in a graph.

The traveling salesman algorithm has a lower space complexity than common sorts or searches

The traveling salesman algorithm is a classic algorithm.