网络释义英英释义
logan [ 'lɔɡən; 'lɔ:ɡ- ]
-
n.
a mountain peak in the St. Elias Range in the southwestern Yukon Territory in Canada (19,850 feet high)
同义词： Mount Logan
以上来源于: WordNet
柯林斯英汉双解大词典
logan /ˈləʊɡən/ (also logan-stone)
-
1.
N → other names for rocking stone
双语例句原声例句
-
If I'm running at nanosecond speed, 1000 n, the size of the problem, whatever it is, is 1000, and I've got a log algorithm, it takes 10 nanoseconds to complete.
如果这个问题的规模，也就是n，是，如果这个问题是对数级的，这将会占据10纳秒的时间，你一眨眼的时间。
-
The red-black tree is O(log n) in time for most operations, while the previous scheduler employed O(1), using a priority array with a fixed number of priorities.
对于大多数操作，红黑树的执行时间为 O(log n)，而以前的调度程序通过具有固定优先级的优先级数组使用 O(1)。
-
As I mentioned in the overview section, random character access on a rope with many internal nodes is approximately o (log n), so traversal is o (n log n).
就像我在概述一节中提到过的，在拥有许多内部节点的rope上随机访问字符的时间大约为o (log n)，所以遍历时间为o (nlog n)。
-
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.
孩子们，这是一个愚蠢的问题，因为前两节课的时候我就已经告诉你们了,复杂度是,但是让我们来看一下是不是真的是这样。
-
N log N is not nearly as good as log N. As a sanity check, what algorithm have we seen that runs in log N time?
而N，log，N和log，N并不一样，我们之前探讨过的哪个算法其时间复杂度是log，N呢？
-
So I have n operations log n times, n log n there we go, n log n. Took us a long time to get there, but it's a nice algorithm to have.
所以我log，n遍的n次操作，就得到了,虽然花了不少时间得到了这个结论。
应用推荐