Things are starting to get really interesting, and will probably end up a little long, this next bonfire will have us write a roman numeral converter. The functionality is quite clear, take in a number and […]
Tag: Recursion
FCC Bonfire Series 104: Factorialize a Number
Things are starting to GET (-unfunny reference-) interesting little by little. This time, we must write a function that takes a number, and returns the result of factorializing said number, welcome to: factorialize a number. (It’s factorize, […]