2 ms·
I don't know whose law says something like, "The amount of optimization left to do is proportional to the improvement you got on the last round". I.e., 14000x
by ncmncm 6y ago
I don't know whose law says something like, "The amount of optimization left to do is proportional to the improvement you got on the last round".
I.e., 14000x means there's probably another factor of 10 or 100 in there. But 0.1s might be fast enough.
I get 2x on std::sort pretty easily. I am hoping to get a general speedup like that for half the algorithms in the C++ Standard Library into C++23. Maybe the other half a little later.
Caches mean nobody knows how fast anything should be, so lots of things seem fast until you see one faster, then the old one suddenly looks slow.