# Write a program to find factorial of any number that can be written

In functional languages, the recursive definition is often implemented directly to illustrate recursive functions.

### Factorial of a number in python

This is because double-precision numbers are only accurate up to 15 digits. Besides, factorial length grows fast along with execution time of Brainfuck program, so the above code is limited to calculating and printing first 7 factorials. Trying to calculate 13! Other implementations such as computer software such as spreadsheet programs can often handle larger values. Note that 0! Most software applications will compute small factorials by direct multiplication or table lookup. The last line of the example applies factorial to each element of sequence, obtained by applying seq to Larger values of n produce a result that has the correct order of magnitude and is accurate for the first 8 digits. This is because single-precision numbers are only accurate up to 8 digits. Computation[ edit ] If efficiency is not a concern, computing factorials is trivial from an algorithmic point of view: successively multiplying a variable initialized to 1 by the integers up to n if any will compute n! Larger factorial values can be approximated using Stirling's formula. For single-precision inputs, the result is exact when n is less than or equal to Note that starting with version you can calculate factorials only up to 12!. In particular, n! Wolfram Alpha can calculate exact results for the ceiling function and floor function applied to the binary , natural and common logarithm of n!

Note that 0! Last calculated factorial is stored in variable c6 and on each step it is multiplied by next number stored in c5. All of them accept scalar values for input; seq returns a sequence of scalars, and the other three return individual scalars. This is often more efficient. Data type. This example uses one minor cheat: classic Brainfuck interpreter uses byte variables to store values of memory cells, so 6!

Larger values of n produce a result that has the correct order of magnitude and is accurate for the first 8 digits. Note that starting with version you can calculate factorials only up to 12!. Most software applications will compute small factorials by direct multiplication or table lookup.

### Algorithm to find factorial of a number using recursion

Wolfram Alpha can calculate exact results for the ceiling function and floor function applied to the binary , natural and common logarithm of n! This is because double-precision numbers are only accurate up to 15 digits. Computation[ edit ] If efficiency is not a concern, computing factorials is trivial from an algorithmic point of view: successively multiplying a variable initialized to 1 by the integers up to n if any will compute n! If the exact values of large factorials are needed, they can be computed using arbitrary-precision arithmetic. Note that 0! To assure that the exact result will fit for all legal values of even the smallest commonly used integral type 8-bit signed integers would require more than bits, so no reasonable specification of a factorial function using fixed-size types can avoid questions of overflow. Larger factorial values can be approximated using Stirling's formula. As documented by Peter Borwein , prime factorization allows n!

Saturation The table below describes the saturation behavior of each data type when used with the factorial function. For the integer data types, the saturation value is equal to the maximum value in the middle column.

Rated 6/10 based on 73 review