Elsevier

Theoretical Computer Science

Volume 410, Issue 36, 31 August 2009, Pages 3372-3390
Theoretical Computer Science

An (18/11)n upper bound for sorting by prefix reversals

https://doi.org/10.1016/j.tcs.2008.04.045Get rights and content
Under an Elsevier user license
open archive

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.

Keywords

Pancake problem
Pancake network
Sorting by prefix reversals
Permutations
Upper bounds

Cited by (0)