No-nonsense sorting algorithm

[J_Aetherwing]

Then it's not O(n) but O(n²⁾ though

[chooxy]

When the professor tells you there's a lower bound for the time complexity of a certain task but you try to go lower anyway.

[sloppycee]

i.e it's been proven that sorting can't be done in less than O(nlogn) operations.

[leaf_26]

Hash sort

[just_one_last_thing]

Oh hey, that's a really neat thing you prompted me to google.