search

aeharding / timeout-sort

Timeout sort is an asynchronous integer sorting algorithm. It can sort all integers with O(max(input)+n).
MIT License
4 stars 0 forks source link

Thanks #2

Open dattilson opened 1 month ago

dattilson commented 1 month ago

I hate it.

dattilson commented 1 month ago

I genuinely believe this tops both bogosort and brainf*ck in comedy value.