使用递归的数字的平方根 [英] square root of a number using recursion

查看:109
本文介绍了使用递归的数字的平方根的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我如何在C中使用递归找到数字的平方根.

How can i find the square root of a number using recursion in C.

推荐答案

我们不做作业:设置它是有原因的.在这里,您可以考虑自己被告知的内容,并尝试理解它.也可以在那里帮助您的导师识别您的弱点,并将更多的注意力放在补救措施上.

自己尝试,您可能会发现它并不像您想的那么难!

(Google可以提供帮助)
We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

Try it yourself, you may find it is not as difficult as you think!

(And google can help)


您需要学习的第一件事是如何进行自己的
First thing you need to learn is how to do your own research[^]. Once you have done that the actual development will be less difficult.


这篇关于使用递归的数字的平方根的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆