FlashSort Algorithm

The Problem of in-situ sorting with minimal auxiliary space in minimal time. Introduction In "Mathematical Analysis of Algorithms", (Information Processing '71, North Holland Publ.'72) Donald Knuth remarked "... that research on computional complexity is an interesting way to sharpen our tools for more routine problems we face from day to day." With respect to the sorting problem, Knuth points out

[taniguchitomoya]

良いソートらしいです。

[izariuo440]

結構早いソートらしい。 The algorithm FlashSort sorts in O(n) time without the manipulation of n extra "tag" bits.