It's an example of a very common tool that's going to be really useful to us, not just for doing search, but for doing a whole range of problems. That is, in essence, the template the describes a log style algorithm.
不仅仅是做搜索,还可以解决一整类问题,本质上,这个模板就描述了,对数形的算法,我们一会再回来。
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.
这里的复杂度不再是对数的了,因为每次在列表中,查找需要线性访问,可能还要糟糕,其实,有些编程语言,如。
It's nR log of p2 over p1 for the process where there's a pressure change.
结果是dS等于nR乘以p2除以p1的对数,这是对压强变化的结果。
If you go and work that out, log2 log of two and you have two log two, by math you can show that for the line r series m 2*log2 is equal to two natural log of two, which is 1 1.386 which is greater than one.
如果你把它计算出来,这二者的对数,你会得到2个,通过数学,你会得到第r列,第m个值,等于,也就是1。386,这大于。
Boy, there's a dumb question, because I've been telling you n log n for the last two lectures the complexity is n log n, but let's see if it really is.
孩子们,这是一个愚蠢的问题,因为前两节课的时候我就已经告诉你们了,复杂度是,但是让我们来看一下是不是真的是这样。
应用推荐