How would you write a non-recursive algorithm to compute n!?
n!
fac = 1 ; for( i = 1 ; i <= n ; i++){ fac = fac * i ; }