Just because you've made your algorithm 1e200 times faster does not mean that you can't improve it any further. It just means you are in a whole new performance scope.
The other week, I moved from an O(n^2) to an O(n) algorithm and saved an arbitrarily large amount of time.
(On the old "patience" sample data, it was a 30,000% speedup after the extra overhead costs. On the new "quick" sample data it would have been a 120,000% improvement. There is no sample big enough to qualify as "patience" anymore.)
Then the next week, I made another 2x improvement.
If you think about it as running in 0.0004 time vs 0.0008 time, you're playing to the pessimist in you with math and psychology tricks.
That extra 2x improvement was still well worth doing!
In reply to Re^4: how to speed up program dealing with large numbers?
by SuicideJunkie
in thread how to speed up program dealing with large numbers?
by Solarplight
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |