是O 英语是什么意思 - 英语翻译

• is o
• are O.

在 中文 中使用 是o 的示例及其翻译为 英语

我最喜欢的圣诞赞美诗是OEmmanuel上来吧。
My favorite Christmas song is O Come Emmanuel.

另外，我终于知道自己的血型是O型Positive。
In order to learn that my blood type is O positive.

如何构build堆是O（n）时间复杂度？?
How can building a heap be O(n) time complexity?

他们无法排除的是O.
The one they couldn't rule out was O.

也就是最坏情况下是O(n)。
So in the worse case, it is O(n).

如果你的血型是O型或Rh阴性它可能与你宝宝的血型不相容。
If your blood type is O or Rh-negative, it may be incompatible with your baby's blood type.

说完整二叉树的高度是O（logn）是什么意思？?
What does it mean to say that the height of a complete binary tree is O(log n)?

一些男孩吻我,一些男孩拥抱我我认为他们是O.K。
Some boys kiss me, some boys hug me I think they're O. K.

此外，Harmony所采用的DRG协议，其协议的复杂度是O（n）,比有些项目在速度上至少快一个数量级。
Harmony's DRG protocol is O(n) complex, which is at least an order of magnitude faster than RandHound.

暴力的解决方法是O(n^2)，计算每个点对间的距离，返回最小值。
The Brute force solution is O(n^2), compute the distance between each pair and return the smallest.

这个查找时间的界限是O（c12logn），其中c是点集的膨胀常数。
The bound on search time is O(c12 log n) where c is the expansion constant of the dataset.

也请注意,该算法的复杂度是O(N**3),N是最长字符串的长度。
Note also that the complexity of this algorithm is O(N**3) where N is the length of the longest string.

用C学习BigO表示法,对这是O(n)还是O(n2)感到困惑.
Learning about Big O notation with C++, confused as to whether this is O(n) or O(n2).

英国人最常见的血型是O型，占人口总数的48%。
The most common blood group in the UK is O, which 48% of the population have.

第一部分花费O(m)，第二部分花费O(n)，所以总时间是O(m+n)。
The first part takes O(m) and the second part takes O(n) time, so the total time is O(m+n).

尽管它的名称，它更像是一个数组在其他语言，而不是一个链表，因为访问元素是O（1）。
Despite its name it is more akin to an array in other languages than to a linked list since access to elements is O(1).

我们忽略1/2常数并看到该算法是O（n）。
We ignore the 1/2 constant and see that this algorithm is O(n).

插入定时器的最坏情况延迟是O（n），但是平均值是O（1）。
The worst case latency for inserting a timer is O(n), but the average is O(1).

由于j可以和N-1一样大，i可以低至0，所以分区的时间复杂度是O（N）。
As j can be as big as N-1 and i can be as low as 0, then the time complexity of partition is O(N).

这种方法计算成本昂贵，因为评估函数的数量是O（N），其中N是参数的个数。
This method is computationally expensive because the number of function evaluation is O(N), where N is the number of parameters.

尽管它的名字更接近于其他语言的数组，而不是链接列表，因为访问元素是O（1）。
Despite its name it is more akin to an array in other languages than to a linked list since access to elements are O(1).

当然，她没有适当的内衣，因为她不是威廉，但她很尴尬，雷克斯可以告诉她是O.K.
Of course she didn't have proper i. d., since she wasn't William, but she was so embarrassed that Rex could tell she was O. K.

最糟糕的是O(n2)，其操作数非常快的暴增。
The worst complexity is the O n2 where the number of operations quickly explodes.

读取一堆数据的行为是O(N)操作。
The very act of reading a bunch of data is an O(N) operation.

最好的情况是O(1)，最坏的情况是O(N)。
In best case it is O(1) and in worst case it is O(n).

为所有的用户对计算杰卡徳相似度的复杂度是O(n^2)，而有了最小哈希后，我们可以将复杂度降到O(n)。
Calculating Jaccard similarity for all pairs of users is O(n2), and with MinHash, we can reduce this down to O(n).

因此启动一个定时器是O（1），停止一个定时器是O（1），并且每个滴答处理是O（n），其中n是未完成定时器的数量。
Starting a timer is therefore O(1), stopping a timer is O(1), and per-tick bookkeeping is O(n) where n is the number of outstanding timers.

如果你很幸运，你可以在一次尝试中猜出这个数字，所以最好的情况是O（1），但这是另一个故事。
If you're lucky, you could guess the number in one attempt and so the best case is O(1), but that's another story.

作为对这个“小小的建议”的回应，在2006年1月，一个由“三名酒鬼与一名外国交换生”组成的团队创立了一家名叫Thompsonsoft的公司，制作并发行了一款名为《我是O.K-杀人模拟器》的游戏。
In response to the'Modest Proposal', a team"Consisting of 3 alcoholics and a foreign exchange student" formed a company called Thompsonsoft and created I'm O. K- A Murder Simulator in January 2006.

是O'Reilly的书。
It is an O'Reilly book.