Computing the first few (150 or so) factorials is a fairly trivial operation. The classic recursive implementation is well known and simple to understand.
fact (n):
if(n<=1)
return 1
return n * fact(n-1)
end
What happens then when we use this to try and calculate a large factorial (say >200). Depending on the system this code is running on […]

DNA Computing is a rising interdisciplinary field, that uses the four DNA bases (A, T, C, G) to perform computation. It attempts to exploit the relationships between the base pairs to create faster, in some situation, computational machines. The field was created by Leonard Adleman in 1994. He demonstrated it was possible […]

Sudoku, if you are unaware, is a great game where you fill in a 9×9 grid based on some number of given clues such that:

Each row contains only one instance of 1 to 9
Each column contains only one instance of 1 to 9
Each of the 9 3×3 boxes contain only one instance of 1

Like most […]