DersCountsort: General-purpose sort with amortized O(N) complexity

By dersoverflow · 2026-08-15 · 2 points · 0 comments

Hi All! If you are interested in sorting algorithms, you will learn something new: 1. It's commonly believed that, on average, comparison sorting can't perform better than O(N log(N)). But this is incorrect! The sorting is bounded by O(C log(C)) where C is the number of unique e…

Open the full discussion on BetterNews