资源的计算时间的算法的复杂性 [英] Resource on computing time complexity of algorithms
问题描述
是否有良好的资源（书，引用，网站，应用程序......），这也解释了如何计算时间的算法的复杂性？
Is there any good resource (book, reference, web site, application...) which explains how to compute time complexity of an algorithm?
由于，这是很难做出具体的事情在我的脑海里。有时它被谈论一个迭代有时间LG为n的复杂性;然后根据与该另一个循环变得n.lg N;有时他们用大欧米加符号来EX preSS它，有时大O等...
Because, it is hard to make the things concrete in my mind. Sometimes it is talking about an iteration has time complexity of lg n; and then according to the another loop it becomes n.lg n; and sometimes they use big omega notation to express it, sometimes big-o and etc...
这些东西是比较抽象的我。所以，我需要有很好的解释和大量的例子来让我看看有什么布莱恩资源。
These things are quite abstract to me. So, I need a resource which has good explanation and a lot of examples to make me see what's goin on.
希望我解释清楚我的问题。我敢肯定，每个人刚开始学习算法，谁也有同样的问题与我的。所以，也许这些经验的人也可以分享他们与我们的经验。谢谢...
Hopefully, I explained my problem clearly. I am quite sure that everyone who just started to study algorithms has also the same problem with me. So, maybe those experienced guys can also share their experience with us. Thanks...
推荐答案
我认为最好的书是的算法导论通过Cormen，Leiserson，维斯特和Stein
I think the best book is Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein.
下面是
Here is it on Amazon.
这篇关于资源的计算时间的算法的复杂性的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
