Under the ship, he printed in big red letters: C-O-N-G-R-A-T-U-L-A-T-I-O-N-S!
在船下面，他用红色大字写着：C-O-N-G-R-A-T-U-L-A-T-I-O-N-S！
Thus, for a typical program invocation with N options, the code needs only O(N) [N*O(1)] comparisons—an order of magnitude improvement over the legacy code.
因此，对于具有N 个选项的典型程序调用，代码只需执行O(N) [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 (logn)，所以遍历时间为o (nlog n)。
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(logn)，而以前的调度程序通过具有固定优先级的优先级数组使用 O(1)。
The restriction to constant labels enables the branch computation to be an o (1) operation rather than an o (n) operation.
常量标签的限制使分支计算成为了一种O(1)运算，而不是O (n)运算。
For example, if the complexity order of the current technique is O(n**2), speeding up the steps by 10x is a lot less helpful than finding an O(n) substitute.
例如，如果当前技术的复杂性等级是O(n**2)，那么将这些步骤加速10倍远不及寻找 O(n) 替代品来得有用。
Retrieve character o (log n) o (1).
检索字符o (logn) o (1)。
N --O So we introduced this notation big O which generally refers to worst case.
的平方。，So，，N，squared。,这里我们介绍一个符号,它泛指最坏的情况。
In the synthesis of N-(o-tolyl)-thiourea from o-toluidine, some effective measures were taken so that the quality of the product was improved and the reaction conditions were optimized.
从邻甲苯胺合成N-邻甲苯基硫脲，对如何提高产物质量，采取了一些有效的措施，获得了最优工艺条件。
Obvious changes of atomic natural charge happened to atoms C(1), H(11), O(28), O(29) and N(27). The bond lengths and bond angles related to these atoms were also varied greatly.
参与新键形成和旧键断裂原子C（1），H（11），O（28），O（29）和N（27）的原子自然电荷及与其相关的键长、键角有明显的变化。
The result of XPS experiment has proofed that the performance changed of the Fe-O, Fe-N-O films is because the composition and structure of film has changed after heat treatment.
XPS实验结果证明薄膜性能改变的原因是热处理后薄膜的成分与结构发生了明显的变化。
The accelerator is implemented with multiple levels of bit manipulator instead of MUX, it reduces the time complexity of the accelerator from o (n) to o .
该方法通过使用分层位操作电路取代分层MUX选择电路实现位操作加速来减少电路时延，使得位操作加速器的时间复杂度从o (N)降到了O 。
Stream I/O Model This leads to efficient I/O but beware: data written to a buffer does not appear in a file (or device) until the buffer is flushed or written out. (/n does this).
流是（表达）读写数据的一种可移植的方法，它为一般的I/O操作提供了灵活有效的手段。
Stream I/O Model This leads to efficient I/O but beware: data written to a buffer does not appear in a file (or device) until the buffer is flushed or written out. (/n does this).
流是（表达）读写数据的一种可移植的方法，它为一般的I/O操作提供了灵活有效的手段。
应用推荐