Hi , This my test result .
< .. >
Num = 48828125
Benchmarking ..... done for 32768 iterations. Sorted from fastest.
Statement Increment Time(ms) Normalize Relative
--------------------------------------------------------------------------------
(#<USUBR @000000002d519368 SF:PF2> 4...) 32768 1778 1778 2.35
(#<USUBR @000000002d519188 SS:PF> 48...) 16384 1093 2186 1.91
(#<USUBR @000000002d5191d8 SF:PF> 48...) 16384 1216 2432 1.72
(#<USUBR @000000002d519228 VK:PF> 48...) 16384 1341 2682 1.56
(#<USUBR @000000002d519278 LM:PF> 48...) 8192 1046 4184 1.00
--------------------------------------------------------------------------------
; 11 表格 从 #<editor "C:/Users/CLH/Desktop/prime-root.LSP"> 加载
_$
chlh_jd,
I can't understand your presentation of processing times.
Can you please post or link to your code.
Note: personally I use a modified verson of MP's Benchmark program.
I've modified Michaels build so that the fastest version is base 1.0 and other times are relative to that.
ie:
if the fastest takes 1000 and the slowest takes 4100 then the relative time is 1.0 for the fastest and 4.1 for the slowest ... so the relative ratio represents the longer processing time.
... the slowest takes 4.1 times as long to process.
Regards