Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

The FlashSort Algorithm

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://www.neubert.net/FSOIntro.html
Author:Karl-Dietrich Neubert
Description: 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.
Levels: College
Languages: English
Resource Types: Topic Tools Miscellaneous
Math Topics: Computer Science

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.