The traveling salesman problem involves n cities with paths connecting the cities

Q) The traveling salesman problem involves n cities with paths connecting the cities

    • O(n)
    • O(n2)
    • O(n!)
    • O(n/2)
...
Explanation: You can add explanation to this Question by commenting below :) Please Contribute!

If you think above Mcq is wrong then please leave us comment with correct answers!

Leave comment below, Write your comment, Reply with your comment