递归与迭代的区别_递归与迭代之间的区别

朱雀 2022-12-07 13:57 268阅读 0赞

![9240d39e8d19b76b55a53e20d4cd02b1.png][]

递归与迭代的区别

In this tutorial you will learn about difference between recursion and iteration with example.

在本教程中，您将通过示例了解递归和迭代之间的区别。

Both recursion and iteration are used for executing some instructions repeatedly until some condition is true. A same problem can be solved with recursion as well as iteration but still there are several differences in their working and performance that I have mentioned below.

递归和迭代都用于重复执行某些指令，直到满足某些条件为止。 递归和迭代都可以解决相同的问题，但是我下面已经提到它们在工作和性能上仍然存在一些差异。

## 递归与迭代之间的区别 **(**Difference between Recursion and Iteration**)** ##

<table> 
 <tbody> 
  <tr> 
   <td>&nbsp;</td> 
   <td><strong>Recursion</strong></td> 
   <td><strong>Iteration</strong></td> 
  </tr> 
  <tr> 
   <td><strong>Definition</strong></td> 
   <td>Recursion refers to a situation where a function calls itself again and again until some base condition is not reached.</td> 
   <td>Iteration refers to a situation where some statements are executed again and again using loops until some condition is true.</td> 
  </tr> 
  <tr> 
   <td><strong>Performance</strong></td> 
   <td>It is comparatively slower because before each function call the current state of function is stored in stack. After the return statement the previous function state is again restored from stack.</td> 
   <td>Its execution is faster because it doesn’t use stack.</td> 
  </tr> 
  <tr> 
   <td><strong>Memory</strong></td> 
   <td>Memory usage is more as stack is used to store the current function state.</td> 
   <td>Memory usage is less as it doesn’t use stack.</td> 
  </tr> 
  <tr> 
   <td><strong>Code Size</strong></td> 
   <td>Size of code is comparatively smaller in recursion.</td> 
   <td>Iteration makes the code size bigger.</td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td></td> 
   <td> <strong>递归</strong> </td> 
   <td> <strong>迭代</strong> </td> 
  </tr> 
  <tr> 
   <td> <strong>定义</strong> </td> 
   <td> 递归是指函数一次又一次地调用自身直到未达到某个基本条件的情况。 </td> 
   <td> 迭代是指一种情况，其中某些语句使用循环反复执行，直到满足某些条件为止。 </td> 
  </tr> 
  <tr> 
   <td> <strong>性能</strong> </td> 
   <td> 它相对较慢，因为在每个函数调用之前，函数的当前状态都存储在堆栈中。 在return语句之后，先前的功能状态再次从堆栈中恢复。 </td> 
   <td> 它的执行速度更快，因为它不使用堆栈。 </td> 
  </tr> 
  <tr> 
   <td> <strong>记忆</strong> </td> 
   <td> 内存使用更多，因为使用堆栈来存储当前功能状态。 </td> 
   <td> 内存使用量较少，因为它不使用堆栈。 </td> 
  </tr> 
  <tr> 
   <td> <strong>代码大小</strong> </td> 
   <td> 递归的代码大小相对较小。 </td> 
   <td> 迭代使代码更大。 </td> 
  </tr> 
 </tbody> 
</table>

Lets write the implementation of finding factorial of number using recursion as well as iteration.

让我们编写使用递归和迭代来查找数字阶乘的实现。

### 递归示例 **(**Recursion Example**)** ###

Below is the C program to find factorial of a number using recursion.

下面是使用递归查找数字阶乘的C程序。

#include <stdio.h>
     
    int factorial(int n){
        if(n == 0)
            return 1;
        else
            return n * factorial(n-1);
    }
     
    int main() {
        printf("Factorial for 5 is %d", factorial(5));
     
        return 0;
    }

### 迭代示例 **(**Iteration Example**)** ###

Below is the C program to find factorial of a number using iteration.

下面是使用迭代查找数字阶乘的C程序。

#include <stdio.h>
     
    int main() {
        int i, n = 5, fac = 1;
     
        for(i = 1; i <= n; ++i)
            fac = fac * i;
     
        printf("Factorial for 5 is %d", fac);
     
        return 0;
    }

Comment below if you have any queries regarding above tutorial for recursion vs iteration.

如果您对以上教程的递归与迭代有任何疑问，请在下面评论。

> 翻译自: [https://www.thecrazyprogrammer.com/2017/05/difference-between-recursion-and-iteration.html][https_www.thecrazyprogrammer.com_2017_05_difference-between-recursion-and-iteration.html]

递归与迭代的区别

[9240d39e8d19b76b55a53e20d4cd02b1.png]: /images/20221123/b3120f09944a4372b1de8f8669160e91.png
[https_www.thecrazyprogrammer.com_2017_05_difference-between-recursion-and-iteration.html]: https://www.thecrazyprogrammer.com/2017/05/difference-between-recursion-and-iteration.html