Merge sort has o (n log n) worst-case and average-case performance.
合并排序的最差性能和平均性能为o (n log n)。
When LOG_SPLIT is set to n, the logging framework logs all statements to the log file sp.log.
当将LOG_SPLIT设置为n时，日志框架就会将所有的语句全部记录到日志文件sp .log中。
Each window has its own log file, typically named ~/screenlog.n, where n is the window number shown in the window menu.
每个窗口有自己的日志文件，文件名通常是 ~/screenlog.n，其中的 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次操作，就得到了,虽然花了不少时间得到了这个结论。
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)。
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纳秒的时间，你一眨眼的时间。
Since the redo log group is inactive and is archived, just clear the redo log - alter database clear logfile group N (where N is the group # of the lost redo log)
由于重做日志组是不活动和归档的，所以只需清除重做日志即可 ——alterdatabaseclear logfilegroupN（其中 N 是丢失的重做日志的组 #）。
If LOG_SPLIT is set to n, you will use sp.log as the name of the log file.
如果LOG_SPLIT被设置为n，那么可以使用sp .log作为日志文件名。
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)。
Although the algorithm itself is complex, it is extremely efficient in practice and operates in o (log n) time.
虽然算法本身很复杂，但它在实践应用中的效率很高，可以按照o (log n)的时间操作。
O(log n) behavior is measurably slower, but only marginally for very large task counts.
O(log n)行为具有可测量的延迟，但是对于较大的任务数无关紧要。
This is unexpected because hash maps have constant time search whereas trees have log(n) search.
这很出乎意料，因为hashmap的搜索时间是常量，但trees的搜索时间却是log(n)。
The JDK documentation indicates that this method gives you a modified mergesort with guaranteed N*log(N) performance.
JDK文档说明，该方法采用修正的合并排序法，保证N*log(N) 的效率。
Retrieve character o (log n) o (1).
检索字符o (log n) o (1)。
Using this notation, you should know that search through a list is O(n) and binary search (through a sorted list) is log(n).
看到这个标记你就应该知道搜索链表的复杂度为O(n)，进行二进制搜索时（已排序）的空间复杂度为log(n)。
This will allow a log (n) look up of packets referenced by SACK options.
这允许对SACK选项指向的包进行log (N)查找。
Recall that returning a single character at an arbitrary position within a rope is an o (log n) operation.
返回rope内任意位置字符的操作是个o (log n)操作。
Record all the action and P/N and S/N of the removed/installed component as well as ATA chapter in the flight log book after any corrective maintenance action has been taken.
在采取任何纠正维修措施后，要将所作的所有工作以及拆下/安装部件的件号、序号，以及涉及到的ATA章节号，都记录在飞行记录本上。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（log n）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
The circuit of the log is actually a typical measuring circuit which can be used as the secondary circuit of some n...
该计程仪的电路为一典型的测量电路，可给导航仪器作二次转换电路。
There are two sorted arrays A and B of size mand n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
这个题是求两个有序数组的中间数，其实这个中间数，如果是奇数，就是中间的那个数，如果是偶数，就是中间的两个数的和的平均值。
There are two sorted arrays A and B of size mand n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
这个题是求两个有序数组的中间数，其实这个中间数，如果是奇数，就是中间的那个数，如果是偶数，就是中间的两个数的和的平均值。
应用推荐