Stats
Implementations
Linear Sort is a tongue-in-cheek theoretical algorithm that achieves apparent linear time by delegating the actual sorting work to an efficient algorithm (typically Merge Sort) and then artificially delaying completion to simulate linear complexity. It is not practical and exists mainly as a joke or thought experiment.
Paradigm
Satirical / Hybrid
Author
Internet folklore
Tier
DTime Complexity
Best
O(n)Avg
O(n)Worst
O(n)Space
O(n)Properties