o.n.的意思

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.