Simple performance question from a newcomer

ZombineDev via Digitalmars-d-learn digitalmars-d-learn at puremagic.com
Sun Feb 21 08:36:22 PST 2016


On Sunday, 21 February 2016 at 16:29:26 UTC, ZombineDev wrote:
> ...
> And if I use the Kahan algorithm:
> 106 ms
> 36 ms
> 31 ms
> The second two results are probably larger due to noise.

I did some more testing and clearly the larger times for N=1000 
were just noise:
[LDC Kahan N=1000]
106 ms
36 ms
31 ms

59 ms
24 ms
22 ms

46 ms
21 ms
20 ms

45 ms
21 ms
20 ms

45 ms
21 ms
20 ms

59 ms
24 ms
21 ms

102 ms
35 ms
30 ms

104 ms
37 ms
29 ms

107 ms
36 ms
31 ms

46 ms
21 ms
20 ms


More information about the Digitalmars-d-learn mailing list