使用递归/迭代思想完成n层嵌套平方根的计算

「爱情、让人受尽委屈。」 2022-10-22 05:26 101阅读 0赞

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70][]

\[程序代码(普通递归思想)\]

#include<stdio.h>
    #include<math.h>
    /* 函数原型 */
    double f(double x, unsigned int n);
    /* */
    int main()
    {
        double x;
        int n;
        printf("Please input x and n:");
        scanf("%lf,%d", &x, &n);
        if(x >=0 && n >= 0)
        {
            printf( "Result=%.2lf\n", f(x, n));
        }
        else
        {
            /* 数据非法 */
            printf("data error!\n");
        }
    }
    /* 计算 n层嵌套平方根 */
    double f(double x, unsigned int n)
    {
        if(n == 0)
        {
            /* 题目规定, 0层嵌套平方根的值为0 */
            return 0;
        }
        else if(n == 1)
        {
            /* 递归的终止条件 */
            return sqrt(x);
        }
        else
        {
            /* 递归的一般条件 */
            return sqrt(x + f(x, n - 1));
        }
    }

\[运行结果\]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 1][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 2][] ![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 3][]

--------------------

另外也可以使用迭代思想解决该问题.

\[程序代码(迭代思想)\]

#include<stdio.h>
    #include<math.h>
    /* 函数原型 */
    double f(double x, unsigned int n);
    /* */
    int main()
    {
        double x;
        int n;
        printf("Please input x and n:");
        scanf("%lf,%d", &x, &n);
        if(x >=0 && n >= 0)
        {
            printf( "Result=%.2lf\n", f(x, n));
        }
        else
        {
            /* 数据非法 */
            printf("data error!\n");
        }
    }
    /* 计算 n层嵌套平方根 */
    double f(double x, unsigned int n)
    {
        if(n == 0)
        {
            /* 题目规定0层嵌套平方根的值为0 */
            return 0;
        }
        /* */
        double s = x;
        unsigned int j = 2;
        while(j <= n)
        {
            /* s变量负责实现迭代 */
            s = x + sqrt(s);
            j ++;
        }
        /* 循环结束后, 最后要取其平方根做为返回值 */
        s = sqrt(s);
        return s;
    }

\[运行结果\]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 4][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 5][]

--------------------

最后还可以通过尾递归思路解决该问题.

\[程序代码(尾递归思想)\]

#include<stdio.h>
    #include<math.h>
    /* 函数原型 */
    double f(double x, unsigned int n, double s);
    /* */
    int main()
    {
        double x;
        int n;
        printf("Please input x and n:");
        scanf("%lf,%d", &x, &n);
        if(x >=0 && n >= 0)
        {
            printf( "Result=%.2lf\n", f(x, n, x));
        }
        else
        {
            /* 数据非法 */
            printf("data error!\n");
        }
    }
    /* 计算 n层嵌套平方根 */
    double f(double x, unsigned int n, double s)
    {
        if(n == 0)
        {
            /* 题目规定0层嵌套平方根的值为0 */
            return 0;
        }
        else if(n == 1)
        {
            /* 递归的终止条件 */
            return sqrt(s);
        }
        else
        {
            /* 递归的一般条件 */
            /* 很容易通过迭代思路转化为尾递归思路 */
            s = x + sqrt(s);
            return f(x, n - 1, s);
        }
    }

\[运行结果\]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 6][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 7][]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70]: /images/20221022/9738f7f3b64840fc973222771b260edd.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 1]: /images/20221022/5a4735f2c48c4a52bcb37e6df4f1f317.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 2]: https://img-blog.csdnimg.cn/20210404153033943.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw==,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 3]: /images/20221022/cca9af805bd1485eb7cd85d032d4e69a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 4]: /images/20221022/1e7b68b5f8b742d3a1e8740007fb5c42.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 5]: /images/20221022/1ffd2424cba24e919ae81ce112bb58f2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 6]: /images/20221022/1c4d1ea790ef4a4f998a6c592ef3fc8b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 7]: /images/20221022/c270d0072d2e499d9c52df9fdca30c0c.png