chapter_computational_complexity/summary/ #13
giscus[bot]
bot
Replies: 33 comments 15 replies
-
|
作者你好，我发现本书中c语言的部分并没有给出实现，对于部分大一的学生不大友好，如果可以，我希望贡献我关于对于那一部分，并在别的平台发布不知道是否可以 |
Beta Was this translation helpful? Give feedback.
-
|
哈喽，欢迎贡献 C 代码！详情请见 #15 |
Beta Was this translation helpful? Give feedback.
-
|
好的好的 |
Beta Was this translation helpful? Give feedback.
-
|
文章中为什么要用( 格式呢，看着好别扭 😁 |
Beta Was this translation helpful? Give feedback.
-
|
Hi 你是指「」括号吗？ |
Beta Was this translation helpful? Give feedback.
-
|
Q&A有点看不懂，回来再看 |
Beta Was this translation helpful? Give feedback.
-
|
Q&A 中关于 “函数和方法这两个术语的区别是什么？”的回答很具有参考意义，有启发。但是“因此”后面的表述就不够恰当，有点误导。 |
Beta Was this translation helpful? Give feedback.
-
|
谢谢指出！已更新 |
Beta Was this translation helpful? Give feedback.
-
|
争取每天浏览一整章~ |
Beta Was this translation helpful? Give feedback.
-
|
Q & A中关于自动优化尾递归的编程语言补充一下，在C# 7.0及以上版本，编译器已经开始支持尾递归的优化，称为"尾调用"。当编译器检测到一个函数调用是尾递归时，它会自动将尾递归优化为迭代形式，避免创建新的栈帧和堆栈溢出。但需要注意的是，这个优化只会在Release模式下生效，而在Debug模式下，编译器不会进行尾调用优化。 |
Beta Was this translation helpful? Give feedback.
-
|
都说要学习c++的特性，不过要怎么学习，怎么才算学会c++的特性？ |
Beta Was this translation helpful? Give feedback.
-
|
赞，请大家继续加油！ |
Beta Was this translation helpful? Give feedback.
-
|
我对函数渐进上界的定义有些困惑，到底是O(n)是函数渐进上界，还是O( f(n) )是函数渐进上界呀？ |
Beta Was this translation helpful? Give feedback.
-
|
都是呀，你举的两个例子 |
Beta Was this translation helpful? Give feedback.
-
|
在我看来算法效率评估中的复杂度分析与实际测试有点像加速度与速度的关系。就像看一辆车的速度性能，是看它跑一百米需要多长时间，还是看它加速到100km/h需要多长时间。 |
Beta Was this translation helpful? Give feedback.
-
|
这里应该得加上Go,Go 也是支持过程式编程(函数),也支持面向对象编程(方法)。 未来Go 的市场 占有也不小哦。 下面以几种常见的编程语言为例来说明。 C 语言是过程式编程语言，没有面向对象的概念，所以只有函数。但我们可以通过创建结构体（struct）来模拟面向对象编程，与结构体相关联的函数就相当于其他编程语言中的方法。 |
Beta Was this translation helpful? Give feedback.
-
|
这里建议增加支持尾递归的编程语言说明。如Lisp系列语言，函数式编程语言，GCC编译器的C语言等 理论上，尾递归函数的空间复杂度可以优化至 |
Beta Was this translation helpful? Give feedback.
-
|
一口气看到这里，打个卡 |
Beta Was this translation helpful? Give feedback.
-
|
2024-8-24 19:00打卡 |
Beta Was this translation helpful? Give feedback.
-
|
看完了 稀里糊涂的 哈哈哈 |
Beta Was this translation helpful? Give feedback.
-
|
2024.11.10，干就完了 |
Beta Was this translation helpful? Give feedback.
-
|
根据【2.3.2 函数渐近上界】 中的操作数量为3+2n那块， 【2.3.3 推算方法】中完整统计，应为2+（1+1）（5n+1）+2n[1+(1+1)(n+1)] = 2+10n+2+2n+4n^2+4n = 4n^2+16n+4 = n^2+n |
Beta Was this translation helpful? Give feedback.
and others
-
chapter_computational_complexity/summary/
Your first book to learn Data Structure And Algorithm.
https://www.hello-algo.com/chapter_computational_complexity/summary/
Beta Was this translation helpful? Give feedback.
All reactions