Stats
Implementations
Flash Sort is a distribution-based sorting algorithm that works by classifying elements into buckets (classes) based on a linear transformation, then permuting elements into their correct classes before finishing with a local sort. It is efficient for uniformly distributed data.
Paradigm
Distribution / Bucket-based
Author
Karl-Dietrich Neubert
Tier
BTime Complexity
Best
O(n)Avg
O(n)Worst
O(n²)Space
O(n)Properties