3 ms·
It's full of stupid comments. E.g. the python implementation has this attached. ```py """Warning: This code completes in a shocking O(n log n) time complexity
by weebull 2y ago
It's full of stupid comments. E.g. the python implementation has this attached.
```py """Warning: This code completes in a shocking O(n log n) time complexity and allocates memory with reckless abandon""" ```
How shocking that sorting is an O(n log n) algorithm.
Edit: he then goes on to use bubble sort.
I think there might be a large amount of tounge in cheek with this blog post, but it doesn't really land.
- CodeBrad 2y agoTechnically, because the bubble sort is implemented at compile time the program is infinitely faster. The answer is produced as a compiler error and so there is zero runtime at all.
- amenhotep 2y agoI thought it all completely landed, that it was very obvious what you were doing, and that it was very funny as well as being real neato. Frankly I would probably put negative stock in the opinion of anyone who sees you accusing that python code of being hard to read and thinks you're remotely serious.