I built a patch that is supposed allow you to enter in a number and calculate the factorial (without using the expressions object).
Factorial of n = n! = n × (n – 1) × (n – 2) × … × 1
Example 5! is 5 × 4 × 3 × 2 × 1 = 120
I used this max msp factorial patch as a guide.
Looking for assistance in making the factorial patch in Pure Data as efficient as possible.
I want to build this patch using Pure Data primitives instead of using the expression object.
Please note that there is a discussion here that using float values instead of integers allows the recursive method for calculating factorials to have higher input values before failure.