自1951年以来，在职的已婚女性的比例已经从刚超过五分之一增长到二分之一。
Since 1951 the proportion of married women who work has grown from just over a fifth to a half.
辩证思想的实质是二分法。
收市时美元下降了二分。
要是我选择一个60度的角，这些数就会是二分之一和二分之根号三。
If I pick an angle of 60 degrees, these are some numbers like half and root 3 over 2.
二分法可以被定义为对弱排序的狄德金分割。
A dichotomy may be defined as a Dedekind cut for a weak ordering.
这使用了二分法思想，利用双调序列，构造出了一种并行的排序算法：双调排序网络。
It constructs a kind of pallel sorting algorithm bitonic sorting net, taking advantage of dichotomy ideas and bitonic serial.
好了，这就是二分查找的基本思想。
好，还有没有关于二分搜索的问题？
五个麻雀不是卖二分银子吗？
他们得的第二分真是易如反掌。
但他在场上投球时，他只有失去了二分。
二分音符，这是一个动作，这是另外一个动作。
我们现在看到的这个世界是多元的，二分性的。
我们怎么加上一个二分音符，从而正好代表了三个四分音符呢？
How can we get a half note that actually equals now three quarter notes?
“库平七钱二分”“光绪元宝”四个字，字体俊秀。
"Library flat seven binary" money "guangxu ingots" four word, font.
在分析二分搜索方法基础上，提出了一种新的搜索方法。
Based on the analysis of binary search method, a new search method is put forward.
下环“库平七钱二分” “光绪元宝”四个字，字体俊秀。
Ring "library flat seven binary money" under the "wing" four word, font.
五个麻雀，不是卖二分银子吗。但在神面前，一个也不忘记。
Are not five sparrows sold for two farthings, and not one of them is forgotten before God?
五个麻雀，不是卖二分银子吗？但在神面前，一个也不忘记。
Are not five sparrows sold for two pennies? Yet not one of them is forgotten by God.
好的，在上次课程的最后，我也给你们看了一个二分查找的例子。
OK. At the end of the lecture last time, I also showed you an example of binary search.
八分音符、四分音符和二分音符在乐谱上是不同长度的三个音符。
Quaver crotch et and minim are three of the different length of notes in writing music.
八分音符、四分音符和二分音符在乐谱上是不同长度的三个音符。
Quaver crotchet and minim are three of the different length of notes in writing music.
八分音符、四分音符和二分音符在乐谱上是不同长度的三个音符。
Quavers, crotchets and minims are three of the different lengths of note in written music.
有序二分决策图(OBDD)是计算网络可靠度最有效的工具之一。
Ordered Binary Decision Diagram (OBDD) is one of the most efficient tools for computing network reliability.
而现在，事情却迎来了奇妙的转机：近代的物理学家纷纷挑战古典的虚实二分论。
Now, in a fascinating twist, modern physics challenges the ancient dichotomy between substance and void.
最后通过实验，在时间效率上与逐字二分的分词词典机制进行了比较。
Then a comparison is given between PATRICIA tree based and binary seek by characters dictionary mechanism.
最后通过实验，在时间效率上与逐字二分的分词词典机制进行了比较。
Then a comparison is given between PATRICIA tree based and binary seek by characters dictionary mechanism.
应用推荐