The FlashSort Algorithm
Library Home || Full Table of Contents || Suggest a Link || Library Help
|The problem of in-situ sorting with minimal auxiliary space in minimal time. A new O(n) sorting algorithm: by advance calculation of the place where each element to be sorted has to go, sorting is performed by permutation of the elements. As an important aspect of the algorithm, a rule is given to find a new cycle leader after a permutation cycle has been closed. Collections of demos and codes are available from the site.|
|Resource Types:||Topic Tools Miscellaneous|
|Math Topics:||Computer Science|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.