Cycle-sort. A linear sorting method

6Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Haddon, B. K. (1990). Cycle-sort. A linear sorting method. Computer Journal, 33(4), 365–367. https://doi.org/10.1093/comjnl/33.4.365

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free