参考：http://web.cs.ucla.edu/~klinger/dorene/math4.htm

A Basic Computer Concept – Recursion

Recursion is a simple but very powerful concept.

Recursion means an instance (or instances) is derived from an exactly identical instance.

Recursion can go on and on infinitely.

This famous art work by M.C. Escher is an example of recursion.
Did the right hand draw the left hand first?
Or did the left hand draw the right hand that draws the left hand ???

Recursion can be applied to solve problems effectively.

To color the following bar, we can recursively divide it up and color the smaller bits. The end result is the same as coloring the entire bar all at once.

This recursive problem solving technique is called “Divide and Conquere”. It divides a big problem into identical smaller ones and solve them. It is usually easier to solve smaller problems.

In math, recursion can be used to simplify complicated problems.

Recursion is used extensively to solve computer and math problems. It can be applied to solve a lot of real life problems too!

基本计算机概念 – 递归

递归是一个简单但非常强大的概念。

递归意味着一个（或多个实例）是从完全相同的实例派生的。

递归可以无限地持续下去。

M.C.埃舍尔的这件著名艺术作品就是递归的一个例子。
右手先画左手吗？
还是左手画了右手，左手画???

递归可以应用于有效地解决问题。

要为以下条形着色，我们可以递归地将其划分并为较小的位着色。最终结果与一次为整个条形着色相同。

这种递归解决问题的技术被称为“分而治之”。它将一个大问题分成相同的小问题并解决它们。解决较小的问题通常更容易。

在数学中，递归可以用来简化复杂的问题。它也可以应用于解决许多现实生活中的问题！