How would you write a non-recursive algorithm to calculate factorials?

Question

How would you write a non-recursive algorithm to compute n!?

Answer 1

long fact(int n) {
    long x = 1;
    for(int i = 1; i <= n; i++) {
        x *= i;
    }
    return x;
}