๐Ÿ”— Flashsort

๐Ÿ”— Computing ๐Ÿ”— Computing/Software ๐Ÿ”— Computing/Computer science

Flashsort is a distribution sorting algorithm showing linear computational complexity O ( n ) {\displaystyle O(n)} for uniformly distributed data sets and relatively little additional memory requirement. The original work was published in 1998 by Karl-Dietrich Neubert.

Discussed on