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！
We receive shipments o n Tuesday and Saturday, which means that we have different items in the store at least twice a week.
我们通常在周二和周六安排发货，这就意味着一个店面的在一个星期内至少更新两次。
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)]比较 —这是对遗留代码的巨大改进。
Though I'm only 17, I'm a full-fledged member of the organization known as O. P. U. L. E. n.
尽管我只有17岁，但是我是一个叫做财富的组织中的资深成员。
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) 替代品来得有用。
The string version of concatenation requires strings you want to join to be copied to a new location, which is an o (n) operation.
String版本的连接操作要求将需要连接的两个字符串复制到新位置，这是一种O (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)。
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)。
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)。
Recall that returning a single character at an arbitrary position within a rope is an o (log n) operation.
返回rope内任意位置字符的操作是个o (logn)操作。
This actually I think derives from a Greek word, "Synkope, " S-y-n-k-o-p-e, synkope.
这个术语我觉得来源于希腊语,Synkope,S-y-n-k-o-p-e
Y. o. N: Bolooloo, you have a big head, too.
波噜噜，你也有一个大头。
A possible ionic charge state distributions of He, c, n, o, ne, Mg, si, s and Fe in solar energetic particle events is presented in this paper.
本文发表了在太阳高能粒子事件中，元素氦、碳、氮、氧、氖、镁、硅、硫和铁的离子电荷态的分布。
This paper introduces a map sort algorithm with extra memory cost, its time complexity is o (n).
本文介绍了映射式排序算法，这种算法附加一定的存储开销，时间复杂性为O (N)。
The Ni(II) cation has a distorted octahedral geometry defined by five N atoms from two dimethylglyoxime molecules and two O atoms from two formate anions.
镍离子与两个丁二酮肟配体上的四个氮原子和两个甲酸根离子上的碳原子配位进而形成八面体配位环境。
Results: in pure n, O-CMCS group (group a) there were a little of new bones formation with plenty fibrous tissues ingrowthed.
结果单纯n, O - CMCS组可见少量诱导成骨现象，但成骨作用不明显，并见大量纤维组织修复。
In pure n, O-CMCS group (group a) there were a little of new bones formation with plenty fibrous tissues ingrowthed.
结果单纯n, O - CMCS组可见少量诱导成骨现象，但成骨作用不明显，并见大量纤维组织修复。
The research content in this dissertation was the nitrogen removal of A/O/N process for domestic wastewater treatment in residential communities.
试验中所采用的A/O/N工艺是在传统A/O工艺的基础上提出的一种适合高氮废水处理的高效脱氮工艺。
In this study we synthesized a series of N-(o-substituted phenyl) maleimides.
本实验研究了一系列N-邻位取代苯基马来酰亚胺的合成。
If you access elements by index, a linked list is not a good solution: you have to traverse the list from the beginning, so it is an o (n) operation.
如果你访问元素的索引，一个链表是不是一个好办法：你必须遍历列表的开始，所以这是一个O (n)的操作。
The o (n) behavior of repeated in operators hurts performance, but you can't switch to using just a dictionary, as you also need the sequence's order.
在操作上重复o (N)行为损害了性能。但是你不能切换去使用一个字典，因为你需要这个序列的顺序。
Organophosphorus compound, toxic, flammable, n. o. s. when "Inhalation Hazard" is on a package or shipping paper.
有机磷化合物，有毒，可燃，未作说明(当包装或运货单上注明“吸入危害”时)。
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操作提供了灵活有效的手段。
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（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
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)).
这个题是求两个有序数组的中间数，其实这个中间数，如果是奇数，就是中间的那个数，如果是偶数，就是中间的两个数的和的平均值。
General, if we do not consider the length of pattern, a time complexity o (n) algorithm should be optimal, but the fact is not the case.
一般，如果不考虑模式串的长度，一个具有时间复杂度o (n)的算法应该是最优的了，但是事实不是如此。
Poisonous liquid, which in contact with water emits flammable gases, n. O. S. (Inhalation Hazard Zone a).
有毒液体，遇水释放可燃性气体，未作说明(吸入危害带a)。
Code volume quite low, but when the need for greater data a longer period of time complexity is o n!
代码量挺少，不过数据较大的时候需要时间比较长，时间复杂度为O n ！
Poisonous liquid, which in contact with water emits flammable gases, n. O. S. (when "Inhalation Hazard" is on a package or shipping paper).
有毒液体，与水接触会放出可燃性气体，未作说明(当包装或运货单上注明“吸入危害”时)。
Poisonous liquid, which in contact with water emits flammable gases, n. O. S. (when "Inhalation Hazard" is on a package or shipping paper).
有毒液体，与水接触会放出可燃性气体，未作说明(当包装或运货单上注明“吸入危害”时)。
应用推荐