最慢的计算复杂度（Big-O） [英] Slowest Computational Complexity (Big-O)

问题描述

超出这些算法，我知道Alg1是最快的，因为它是n平方。接下来是Alg4，因为它是n立方，然后Alg2可能是最慢的，因为它是2 ^ n（应该是性能很差）。

但是在速度方面，我还没有遇到过Alg3和Alg5。这两种算法在快慢方面如何与其他3种相比呢？谢谢您的帮助。

编辑：现在我想到了，Alg3是指O（n log n）吗？如果其中的ln表示'log'，则将使其成为最快的。

解决方案

升序为： 。

Out of these algorithms, I know Alg1 is the fastest, since it is n squared. Next would be Alg4 since it is n cubed, and then Alg2 is probably the slowest since it is 2^n (which is supposed to have a very poor performance).

However Alg3 and Alg5 are something I have yet to come across in my reading in terms of speed. How do these two algorithms rank up to the other 3 in terms of which is faster and slower? Thanks for any help.

Edit: Now that I think about it, is Alg3 referring to O(n log n)? If the ln inside of it means 'log', then that would make it the fastest.

解决方案

The ascending order would be: n·log(n) < n² < n³ < 2ⁿ < n! for n ≥ 10.

Also have a look at the Big-O Algorithm Complexity Cheat Sheet.

这篇关于最慢的计算复杂度（Big-O）的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！