Skip Navigation

The Computer Journal 1990 33(4):365-367; doi:10.1093/comjnl/33.4.365
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Haddon, B. K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Cycle-Sort: A Linear Sorting Method

B. K. Haddon *

R-1032/WRZ, Ciba-Geigy AG, CH-4002 Basel, Switzerland

Two sorting algorithms are described, general_cycle_sort, and special_cycle_sort, based upon the decomposability of a permutation into a product of cyclic permutations. Under the conditions in which these algorithms are applicable, the sorting can be accomplished in linear time.

Received May 1987. revised April 1990.

* Now at R-1032/WRZ, Ciba-Geigy AG, CH-4002 Basel, Switzerland.

§ Department of Computer Science, University of Colorado at Boulder, Boulder, Colorado 80309-0425, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.