log算法
原声例句
-
And we said that was log rhythmic, took log n time where n is the size of the list.
当列表的长度为n的时候，整个算法耗时log，n的时间。
-
In the log case, it's divide by an amount.
而在对数算法中。
-
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呢？
应用推荐
$firstVoiceSent
- 来自原声例句