Math, asked by aglawe62, 5 hours ago

Q.2) In the TSP problem of n cities, the time taken for traversing all cities, without having prior knowledge of the length of the minimum tour will be (1 marks) has Onl) C(n/2) Qin2) O(n)​

Answers

Answered by devabarikinamanasa3
1

Answer:

I don't know if you have any questions ask me then I will tell you ok

Similar questions