3 ms·
Bigoish: Test the empirical computational complexity of algorithms in Rust
- malklera 7mo ago> Notice that in all cases time spent sleeping or otherwise waiting shouldn’t be counted, though you probably shouldn’t do that in your code in the first place. I thought the time your CPU waits around doing nothing is something you want to measure. If your algorithm has better "mathematical" scaling with big N but is worse in real world scenarios, it "failed". Or maybe the application of this is another?