Comments

OrthogonalCaster 16th February

the newest is v5, not v4. Added the oldest model too
OrthogonalCaster 16th February

2b) if it is not, output the counter value to result and X value to remainder
OrthogonalCaster 16th February

2a) if it is, add 1 to the counter, output the counter value to result and 0 to remainder
OrthogonalCaster 16th February

2) if the numbers are not equal, when the division loop is over, check if the last recorded non-zero remainder (X) is equal to the divisor:
OrthogonalCaster 16th February

1.2b) if they are not, subtract 1 from the counter
OrthogonalCaster 16th February

1.1a) if they are, output the counter (which will equal 1)
OrthogonalCaster 16th February

1.1) while the division is being performed, determine if the numbers are equal:
OrthogonalCaster 16th February

1) step by step, subtract the divisor from the dividend and count when this operation succeeds
OrthogonalCaster 16th February

Algorithm for the divider v4:

The Powder Toy