递归法(Recursion)

递归法(Recursion)

---

简介(Introduction)
Recursion occurs when a thing is defined in terms of itself or of its type. Recursion is an important algorithmic design technique. In this blog, we talk about some algorithms based on recursion.

阶乘(Factorial Numbers)

function Factorial(n)
    if n = 0 then
        return 1
    return n*Factorial(n-1)

斐波那契额数列(Fibonacci Numbers)

function Fibonacci(n)
    if n = 0 or n = 1 then
        return 1
    return Fibonacci(n-1)+Fibonacci(n-2)

汉诺塔(The Tower of Hanoi)

function Hanoi(n, init, aux, fin)
    if n > 0 then
        Hanoi(n-1, init, fin, aux)
        Move one disk from init to fin
        Hanoi(n-1, aux, init, fin)

最后再说两句(PS)
The idea of recursion can be used in a variety fields. Read more.
Welcome questions always and forever.