STOP in 34s

[Dieter]

(12-01-2015 08:07 PM)ggauny@live.fr Wrote:  It is because I search a routine that give me the primes factors divisors of an integer, so if my test is false I ask the routine return at LBL'x', in others words :
if the test is true : pause, if false go up to the first line to redo the search, but not go to the first line of program.

This is what I don't understand, because to know what is primes divisors of an integer I divide by 2, after i divise by 2 one again, if not divisible I up to line one and I try with 3, and so on.

This is not a problem concerning the R/S key or the STOP command, it's simply a question of the algorithm. Here is a VERY simple, in no way optimized version of such an algorithm. But is will work. ;-)

Code:

input n
divisor = 2

:start   <---------------+
                         ^
if n mod divisor = 0     |
   print divisor         |
   n = n / divisor       |
   goto start   ---------+
                         ^
divisor = divisor + 1    |
if divisor <= sqrt(n)    |
   goto start  ----------+

print n

Now try to write a 34s program that implements this method.

If if works you can add the first improvement: after the first divisor has been incremented from 2 to 3, increment all following divisors by two so that you get 2 3 5 7 9...

(12-01-2015 08:07 PM)ggauny@live.fr Wrote:  It is difficult because I don't understand your english and you don't understand mine.

I am not sure if you would understand my French – it is really bad. #-)
But I think I would understand the one or other French sentence you write. At least if it's not too complicated. ;-)

Dieter