o.n.发音

意思翻译

o、 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）的算法应该是最优的了，但是事实不是如此。

You may be reading this message now as a donor, a volunteer, a supporter of our campaigns, or as a reader of O. N. E e-magazine.───您现在读到这篇文章，可能因为您是乐施会的捐款者、义工、我们倡议项目的支持者，又或是《乐施电子报》的读者。

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）操作。

Firstly, s speed-up method with the computational complexity O(n) was developed to calculate the make span of a permutation.───首先，基于复杂度为O（n）的最大完成时间算法简化了适应值的计算；

But there are a few customers who have purchased or rated a significant percentage of the catalog, requiring O(N) processing time.───但有少数顾客，他们买过或评级过的商品在产品目录中占有值得注意的百分比，需要O（N）处理时间。

When we were putting the broken pieces together again, "Free Tibet" you screamed, "it was an invasi o n! "───但我们把碎片重拼接好时，你们叫嚣“解放”被“入侵的西藏”。

英语使用场景

Being an efficient model for large scale system, the DVM-DAC algorithm has the O(n) linear scaling character originated from using the divide-and-conquer theory.

Guitar £200 o.n.o.

Bicycle for sale: ￡60 o.n.o.

The last major section of the book contains the data for describing or identifying all ions containing C alone and C with H, O, N, S, P, halogens , and small organic cations.

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( ).

Please enclosed a crossed cheque in favour of light-of-love Limited and post to Room 1113, Ming Yat House, Kin Ming Estate, Tseung Kwan O, N. T.

However, more complicated uses of Simple Segregated Storage may require a sorted free list, which makes deallocation O(N).

If you need only to compute the distance and not alignments, as is usually the case, it is easy to reduce this to O(n), since only the previous row is required to compute the next.

Merge sort has O(n log n) worst-case and average-case performance.