有关递归算法复杂性的信息
有谁知道一些关于计算递归算法复杂性的好资料? 不知怎的,循环方程并不是真正流行的网页标题或者什么,我只是无法用谷歌搜索出任何合理的东西......
does anyone know about some good sources about counting complexity of recursive algorithms?
somehow recurrent equation isn't really popular title for web page or what, I just couldn't google out anything reasonable...
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(3)
这是一个复杂的话题,在互联网上的免费文献中并没有很好的记录。
我刚刚做了一次类似的考试,我可以向您推荐我的老师编写的手册: PDF手册
这本手册主要介绍了另一种称为生成函数的工具,它对于解决任何类型的递归问题很有用,而不必过多关注递归类型。
有一本关于算法分析的好书,即算法分析简介 (亚马逊链接),但你在网上找不到它(我必须扫描其中的一部分) 。
顺便说一句,我在互联网上进行了很多搜索,但没有找到任何完整的参考资料,其中包含对学习技术有用的示例。
This is a complex topic that is not so well-documented on free licterature on internet.
I just did a similar exam and I can point you to the handbook written by my teacher: PDF Handbook
This handbook covers mostly another tool called generating functions that are useful to solve any kind of recurrence without bothering too much on the kind of recurrence.
There is a good book about Analysis of Algorithms that is An introduction to the Analysis of Algorithms (amazon link) by Sedgewick and Philippe Flajolet but you won't find it online (I had to scan parts of it).
By the way I've searched over internet a lot but I haven't found any complete reference with examples useful to learn the techniques.
我认为您会更幸运
I think you would have had more luck with recurrence equation.
您还可以查看主定理。
You can also check out the Master theorem.