How can I do mod without a mod operator?

Question

This silly scripting language doesn't have a % or Mod(). I do have a Fix() that chops off the decimal part of a number. I only need positive results, so don't get too robust.

Answer 1

Will

// mod = a % b

c = Fix(a / b)
mod = a - b * c

do? I'm assuming you can at least divide here. All bets are off on negative numbers.

Answer 2

This may not work for you performance-wise, but:

while (num >= mod_limit)
    num = num - mod_limit

Answer 3

a mod n = a - (n * Fix(a/n))

Answer 4

What language is it?

A basic algorithm might be:

hold the modulo in a variable (modulo);
hold the target number in a variable (target);
initialize modulus variable;

while(target>0){
if(target>modulo) {
target -= modulo;
} else if(target<modulo) {
modulus = target;
break;
}
}