Pancake Sort

I understand the basic algorithm, but apparently there is a faster one, that is the one I do not understand.
Pancake sorting is a variation of selection sort. But instead of a simply swap you perform two flip
Having a complexity of O(n^2) there are a lot of algorithms that are faster ¿which one are you referring to?
this is the site that sparked the question:
http://www.maa.org/mathtourist/mathtourist_10_9_08.html
Topic archived. No new replies allowed.