Thread: I'm dreaming of solving the travelling salesman problem in O(nlogn)

There. Now will I get two pages of comments as well?

Ah, I bet you guys will need what I've tried so far to tell me how to fix it. Well, right now I have this:

Code:

#include <stdio.h>
using namespace std;

main()
{
};

Now what should I do?

The "TSP" problem is "NP-Hard". It doesn't even fall into the same universe as sorting.

In the referenced thread, no one posted source to do what the OP wanted. We only critiqued the idea and, when posted, the source.

I'll tell you the same thing I told the OP of that thread, if you have an O(n * log(n)) solution to the "TSP" problem, I'd love to see it. If you fail to match that goal, I'll be happy to critique your source as well.

So do you have a solution? Or were you honestly just wanting to make a fool of yourself by whining because your previous thread didn't get as much attention as you thought it deserved?

Soma

Originally Posted by phantomotap

So do you have a solution? Or were you honestly just wanting to make a fool of yourself by whining because your previous thread didn't get as much attention as you thought it deserved?

"My previous thread"? I don't even know which one that would be.

This was kind of a tongue-in-cheek for 2 posts, but also a hundreds of others over time. Yes, the most obvious is the "insertion sort". And if you don't think it deserves to be made fun of, read the post again.

I forgot to add one thing to my previous post though. See, my compiler seems to have a bug as the following doesn't compile bud give a error:

Code:

RG3ij53ji50jithETH9j5h9j0hwtHW0gqrlpq';reglQERg;lqerg;lg

Do you know working compiler?


There, I just wasted another minute of your time :P. But it feels good to relieve myself of my annoyances.