5、归纳与递归

作者：whj95

导读

数学归纳法 (mathematical induction)

　　BASIS STEP: 令n=1（最开始的元素），判断P(1)是否成立
　　INDUCTIVE STEP:
　　①假设n=k-1时P(k-1)成立
　　②运用①进而判断n=k时P(k)是否成立
　　

强归纳法(strong induction)

　　BASIS STEP: 令n=1（最开始的元素），判断是否成立
　　INDUCTIVE STEP:
　　①假设1≤j≤k-1时，P(k-1)成立
　　②运用①进而判断n=k时P(k)是否成立
　　

结构归纳法(structural induction)

　　BASIS STEP: Show that the result holds for all elements specified in the basis step of the
recursive definition to be in the set.
　　RECURSIVE STEP: Show that if the statement is true for each of the elements used to construct
new elements in the recursive step of the definition, the result holds for these new elements