-
We did that, we came up with very good Chinese search engine technology, and we signed up a lot of the Chinese portals in a very short period of time.
我们开发了,很好的中文搜索引擎技术，并在短期内，和许多门户网站公司,签了合约。
-
At the time of the IPO, Baidu had about 40% of the traffic share in China for Chinese search.
当百度IPO上市的时候，百度占据了,中国40%的中文搜索量。
-
OK. At the end of the lecture last time, I also showed you an example of binary search.
好的，在上次课程的最后，我也给你们看了一个二分查找的例子。
-
From time to time, they wandered to Egypt or Mesopotamia often in search of pasture for their animals. And various details of their language, their customs, their laws, their religion, it's argued, seem to fit well into the period of the Late Bronze Age.
时而不时的，他们常在埃及或美索不达米亚游荡,为他们的牲口寻找牧场，大量关于他们的语言,他们的习俗，他们的律法，他们的宗教的细节，据说，都与融入了后青铜时期的特征。
-
From that time ever since, the sad friends of Truth, such as durst appear, imitating the careful search that Isis made for the mangled body of Osiris, went up and down gathering up limb by limb still as they could find them.
从那时起，真理的朋友非常悲痛，只要看到尘土漫天飞扬，就学着伊西斯寻找被损害的欧西里斯,一样仔细寻找真理的影子，上上下下搜寻真理的碎片就像似乎他们真的能找到一样。
-
All right? It's now something that I can search in constant time. And that's what's going to allow me to keep this thing as being log.
在固定的时间内搜索,这样就可以让时间复杂度保持在对数级,好的，考虑过了这些。
-
Well let's see. My fall back is, I could just do linear search, walk down the list one at a time, just comparing those things. OK. So that's sort of my base. But what if I wanted, you know, how do I want to get to that sorted list? All right?
我只能做线性搜索了,一次遍历一遍列表，一个一个比较，但如果我想要,那怎样得到有序的列表呢？,现在的一个问题是，我们排序之前？
-
I could still do the linear case, which is order n or I could say, look, take the list, let's sort it and then search it. But in that case we said well to sort it was going to take n log n time, assuming I can do that.
我仍然可以做O的线性搜索,或者也可以以这个列表为例，我们先将其进行排序,然后再进行查找，但是在这种情况下,要花费n，log，n的时间去对其进行排序。
-
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的复杂度,这样做引出了耗时分摊的想法,这时不仅需要考虑耗时的因素？
应用推荐