-
OK. So this is, in fact, log. Now, having said that I actually snuck something by you.
就是对数次,我已经教给你们一些。
-
Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.
这里的复杂度不再是对数的了，因为每次在列表中，查找需要线性访问,可能还要糟糕,其实，有些编程语言，如。
-
Log n Log n, because at each stage I'm cutting the problem in half. So I start off with n then it's n n/2 n/4 n/8 over two n over four n over eight.
因为总共有多少层？,因为在每一层，我都是把问题分解成两半,因此以n开始，然后是。
-
It would be nice if it was less than linear, but linear is nice because then I'm going to get that n log in kind of behavior.
那么就是一个不错的算法，但是线性方案也是很好的,因为我需要做n次的log级的行为。
-
On the other hand, if I want to sort it first, OK, if I want to do sort and search, I want to sort it, it's going to take n log n time to sort it, and having done that, then I can search it in log n time.
我先排序，好的，如果我想排序再搜索，我要排序，这需要花n，log，n时间排序，然后做完了，我们能花log，n时间搜索,啊，哪一种更好呢？恩，呵呵。
-
Once I have it sorted I can search it in log n time, but that's still isn't as good as just doing n. And this led to this idea of amortization, which is I need to not only factor in the cost, but how am I going to use it?
一旦对其完成排序,就可以在log，n的时间内对其完成搜索,但是这样做仍然不如n的复杂度,这样做引出了耗时分摊的想法,这时不仅需要考虑耗时的因素？
应用推荐