Divisor Calculator

My first-ever algorithm that made my life easier when I was in 7th grade.

It calculates the divisors of a number, so all numbers through which can be divided without a remainder. For example for 100 it is 1, 2, 4, 5, 10, 20, 25, 50, 100.

The original algorithm was written on a Commodore 128 with an up to 2 MHz processor, as the calculation took quite some time with my first approach.

As I gained more knowledge about algorithms and mathematics over the years (especially the modulo operation), I optimized this algorithm further.

So this simple calculator accompanied me over some years and is thus something special for me.

I always hoped to find a perfect algorithm without trying if the division is without a remainder, but just jumping from one divisor to the next.
Today, I know that this kind of mathematical problem is not to be solved easily and our cryptography relies on it. So, now I'm in inner peace, not searching for better solutions anymore.