From: Lyle K. <te...@ke...> - 2001-02-12 20:50:08
|
* ra...@ra... (ra...@ra...) wrote: > On 12 Feb, Lyle Kempler scribbled: > ->> i guess the proof is in the pudding - run the code. it's blindingly > ->> fast. > -> Code appearing fast on a fast machine is no way to judge performance. > -> You judge performance in asymptotic form, as Tom did earlier. Any other > -> way is a farce. > it's fast on the p2-300 (IDE, 8mb milennium 2) i use as my "slow system" > testbed :) That's still not good analysis of the performance. ;) Asymptotic is the only way to get that. And all of this relates back to my design argument.. <grin> term |