Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!


Forgot your password?
Slashdot Deals: Cyber Monday Sale! Courses ranging from coding to project management - all eLearning deals 25% off with coupon code "CYBERMONDAY25". ×

Submission + - Pancake flipping is hard - NP hard (i-programmer.info)

mikejuk writes: French computer scientists have finally proved that sorting pancakes is hard — NP hard.No really — this isn't a joke. Well, it is slightly amusing but that's just because it is being presented as pancake flipping. The algorithm in question is sorting a permutation using prefix reversal — which is much easier to understand in terms of pancakes. Basically you have to sort a pancake stack by simply inserting your spatula and flipping the top part of the stack. We now know that if you can do the this in polynomial time then you have proved that P=NP.
Pancakes have never seemed so interesting....

This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

Pancake flipping is hard - NP hard

Comments Filter:

You don't have to know how the computer works, just how to work the computer.