2 ms·
Forget the locking and data race problem...I think about the massive performance problem. It turns multiplication into O(n) instead of O(log n). `mult 2000` w
by Sohcahtoa82 5y ago
Forget the locking and data race problem...I think about the massive performance problem.
It turns multiplication into O(n) instead of O(log n). `mult 2000` would take 2000 times longer than `mult 2`.
Imagine being able to DoS a server just by asking it to multiply two numbers.