Flashsort is a distribution sorting algorithm with linear computational complexity for uniformly distributed data sets and a relatively small additional memory requirement. It was originally published in 1998 by Karl-Dietrich Neubert.
Facts
Time Complexity
Time Complexity (category) Connections
In Field
Source Flashsort (Wikipedia)
Sources
1. Flashsort (Wikipedia)
Wikipedia article body, read for Browse By backfill (w-bbfill-computing6-0927)
Flashsort (Wikipedia)
In Field: Algorithms and Complexity Theory, Lead section
Flashsort is a distribution sorting algorithm showing linear computational complexity O(n) for uniformly distributed data sets and relatively little additional memory requirement.
In Group: Distribution and Integer Sorting Algorithms, Lead section
distribution sorting algorithm
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.