HP Prime: a student's view

[Liam Hays]

Well this certainly exploded.

Tom L: I changed my code to what's below, per your suggestion, and I actually got a higher performance index, 528,000. (give or take a few hundred)

Code:

from math import *
def p_ind():
    n = 100000
    while n != 0:
        l = 10
        while l != 0:
            x = l
            x += 1
            x -= 4.567e-4
            x += 70
            x -= 69
            x *= 7
            x /= 11
            l -= 1

        x = log(x)
        x = sin(x)
        x = sqrt(x)
        x = sqrt(x)
        n -= 1

Even if I take Tom L's original code and remove the if r0 <= 0: branch, replacing the while True with while r0 != 0, I still get about the same performance as before (~170,000). I even get that same index if I replace the outer for loop with a while i != 0 loop (where i starts out as 10000 and is decremented each loop).

Thomas_Sch Wrote:imho there are few differences in the implementation.

Clearly, but where are they? I can't find anything at all, beyond differences in loops.