[HP35s] Benchmark of some operations
|
02-13-2019, 10:20 AM
(This post was last modified: 02-13-2019 10:21 AM by fred_76.)
Post: #1
|
|||
|
|||
[HP35s] Benchmark of some operations
Hello,
Here is a benchmark of some of the HP35s operations/functions. It shows the execution time in milliseconds. Code:
You will notice that the more digits a number has, the longer it takes for execution. Take these figures as indicative only ! Fred |
|||
02-13-2019, 10:57 AM
Post: #2
|
|||
|
|||
RE: [HP35s] Benchmark of some operations
Out of interest - How are you measuring these?
Denny Tuckerman |
|||
02-13-2019, 12:02 PM
(This post was last modified: 02-13-2019 12:19 PM by fred_76.)
Post: #3
|
|||
|
|||
RE: [HP35s] Benchmark of some operations
(02-13-2019 10:57 AM)Leviset Wrote: Out of interest - How are you measuring these? I programmed a loop, and first manually measure the time taken by the empty loop (t0). I do this manually as the HP35s does'nt have internal timer. The code is like that, nnn being the number of iterations (usually 1000) : Code:
Then I just have to insert the instruction(s) to test in line 4, restart the test program and measure the time t1. The time per (set of) instruction(s) is then 1000*(t1-t0)/nnn in ms. I repeat this several times (especialy when t1-t0 < 10s) and take the shortest time measured. It is quite precise, I calculated the time for the calculation of the prime number 99 999 999 977 using the algorithm shown here and found a theoretical value of 14'40", to be compared to the real time of 14'37". Fred |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: