By Topic

Improved upper bound for sorting by short swaps

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Feng, X. ; Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA ; Meng, Z. ; Sudborough, I.H.

We consider the problem of sorting an arbitrary permutation of length n using substring reversals of length 2 or 3. This has been called "short swaps ". We give an upper bound of (5/24) n2 + O(nlogn), improving the previous ( 1/4 ) n2 upper bound. We also show that there is a short swap sorting network with ( 1/4 ) n2 +O(nlogn) comparators and depth n.

Published in:

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date of Conference:

10-12 May 2004