Jump to content

xkcd does it again


Playaa

Recommended Posts

http://xkcd.com/c287.html

 

And like me, Playaa, I'm sure you'll try.

 

I can't see what the waiter's big deal was, it wasn't that hard, especially if you have a good algorithm.

 

The one thing that bothers me is that he talks about the traveling salesman problem. While NP-hard, it has nothing to do with this special case of the Knapsack Problem. As a teacher would have reminded me, this is actually the subset sum problem, which is commonly fought in cryptography, but since it's still a special case of the Knapsack Problem I don't get so pedantic.

Edited by appalachian_fox
Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...