-
Karadzic is also charged with persecution, extermination and murder as well as taking U.N.peacekeepers hostage and the 44-month long siege of Sarajevo.
VOA: standard.2009.10.26
-
And if you put this in the well-ventilated area, if you prepare this outside, the h c n gas will actually be released into the air, so you're safe, you can eat it later.
而如果你把它们放在通风良好的地方，在室外处理，那么氰化氢气体,将会被释放到空气中，这样你就安全了，过后就可以吃了。
-
n Alright. So if n is less than or equal to 1, return n. Well that's not right, right?
好吧，如果n小于等于1，它会返回，这里不对，是吧？
-
This backlash N, it's also a recurring theme and not just in C but in PHP, JavaScript, other languages as well.
还有反斜杠n，不仅C语言里有,在其他语言像PHP，JavaScript等都会碰到。
-
He constantly warns his son, who was kind of an n'er do well, that, "You better work hard, " Or, "You better work a little harder and pay more attention to what you're doing.
他不断提醒那一事无成的儿子,"你要加倍用功,哪怕只是稍微用点心,对你做的事要更上心
-
So, there are 2 different things that we can compare when we're comparing graphs of radial probability distribution, and the first thing we can do is think about well, how does the radius change, or the most probable radius change when we're increasing n, when we're increasing the principle quantum number here?
当比较这些径向概率分布图,的时候，我们可以比较两个东西，第一个就是考虑当我们增加ｎ,当我们增加主量子数的时候，半径怎么变，最可能半径怎么变化？
-
N 6 Sixteen, so that's 16 times log base 2 of 16 and though I'm writing small here, log base 2 of 16, 16 this gives me 4 'cause 2 to the 4 equals 16.
是多少呢？，Well，，N，is，what？,16，那就是16乘以以2为底16的对数6,在这儿我将2写小一些，以2为底16的对数是4，因为2^4等于。
-
N Well, here is a list of size N. How many times can you divide a list of size N by 2, right?
这是一个大小为N的列表，将一个大小为,的列表除以2需要几次呢？
-
If they type in bogus characters, it's going to yell at them and make them retry, and eventually I'm going to get handed back an int, which I'm storing in n. Well, if I actually want to judge this number based on its magnitude, well, I can say now, "If n is greater than or equal to one."
如果他们键入了不合法的字符，它将对他们叫喊,然后叫他们重试，最终我将,得到一个int数，它是存储在n中的，好的，如果我的确想要根据它的量级来判定这个数字，好的，现在我可以指明，“是否n大于等于1“
-
I could still do the linear case, which is order n or I could say, look, take the list, let's sort it and then search it. But in that case we said well to sort it was going to take n log n time, assuming I can do that.
我仍然可以做O的线性搜索,或者也可以以这个列表为例，我们先将其进行排序,然后再进行查找，但是在这种情况下,要花费n，log，n的时间去对其进行排序。
-
O Right there, order n. So I have order n operations at each level in the tree. And then how many levels deep am I? Well, that's the divide, right? So how many levels do I have?
在这儿,所以我在树的每个层次都要做O的操作,那个这棵有多少层呢？,这是一个除法，不是吗？
-
I was just finding very tunnel vision-like, the smallest elements at that moment in time which means I don't know anything about the other elements other than they are not the smallest and so no matter what with Selection Sort I had to repeat this again and again and again and if you do out the math it's roughly N squared steps in the worst case as well.
我只有一个狭窄的视野，只知道某时刻的最小元素,就意味着我并不知道其他元素的任何情况,只知道它们不是最小的,所以不管怎样，在选择排序中,我就得一遍一遍地重复选择过程,在最坏情况下,大概需要N的平方次比较。
应用推荐