i love algorithmic complexity in practice!!!!
3
Replies
0
Boosts
me when i sit for more than two seconds on a line of code and realize that it can be solved by sorting an array and walking the contents...... begone O(n^2)
O(n log n) has entered the building...
@steeps I'm still proud of the time I realized that a linear-time counting sort was the right answer for an algorithm I was looking at (https://github.com/bytecodealliance/wasmtime/pull/8503). begone O(n log n)!
