Publisher : Theoretical Computer Science
Campus : Amritapuri
School : School of Engineering
Department : Computer Science
Year : 2009
Abstract : The pancake problem asks for the minimum number of prefix reversals sufficient for sorting any permutation of length n. We improve the upper bound for the pancake problem to (18/11)n+O(1)≈(1.6363)n.