But the premise of using the algorithm is that echo path is sparse.
但是这种算法有效的前提是回声路径是稀疏的。
A search query returns a set of objects, each of them will be processed individually, using the algorithm described in 1.1.
搜索查询返回一组对象,其中每个对象将使用1.1中描述的算法单独进行处理。
A search query returns a set of objects and each of them will be processed individually using the algorithm described in 2.1.
搜索查询返回一组对象,并且其中每个对象将使用2.1中描述的算法单独进行处理。
And so the fact that in this whole slide here, this algorithm for sorting, I'm using the verb sort.
在这个排序算法中,我用到了一个动词排序。
If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?
如果我用归并排序算法,对N个元素其运行时间,就等于此算法一半元素的运行时间,另一半的运行时间,再加上N,这个N是什么呢?
应用推荐