首先创建递归的concat函数。
工具不支持递归的 XML 模式的注释。
The tool does not support annotation of recursive XML schemas.
In week zero, when we tore the phonebook in half and half and half we were recursing through that problem.
当我们将电话簿划分为一半又一半的时候,其实就是利用递归在解决问题。
Well, the infinity mechanism, and many of you will be familiar with this from mathematics or computer science, is recursion.
这种无限机制是递归的,你们许多人会在数学与计算机科学中,熟悉这个词
What's the point of this? Again, now that I can think about things recursively, I can similarly break things down into simpler versions of the same problem. It could be one version.
这些的意思是什么呢?再一次我想说,我既然能够以递归的方式思考了,那么我就可以简单地把问题,转化为更简单的同类问题。
应用推荐