O.K. But don't you be thinking that I'm goingto be calling you "sir."
VOA: standard.other
I'd really like to have that modularity that says, I'm only going to get access to the values, not by calling their names, but by calling some specific method to get access to their names.
这样我们就丢掉了代码的模块化,我很希望代码有这样的模块化:,我访问变量的值,不是通过直接调用它们的名字,而是通过调用某个可以,访问这些变量名的方法来访问。
and then I'm calling up and I'm, meanwhile I'm running out of money.
然后我不停地打电话,同时,我的钱也慢慢地用光了。
And henceforth I'm gonna start calling these tools, these monickers that I can use as building blocks in my own program, it's gonna be called a function as we'll see.
从此以后,我将在我的程序里把这些工具,称为我们可以用来写代码的组件,在我自己的程序中,我们将了解到它被叫做为一个函数。
OK. So if I look at this code, first of all I'm calling search, it just has one call, so looks like search is constant, except I don't know what happens inside of b search. So I've got to look at b search.
首先调用一下搜索,就一步调用,看起来搜索是固定的,除非我不知道二分搜索的原理,那我们来看看二分搜索吧,所以让我们看看,第一行打印出来的内容。
I'm thinking of finishing and calling it When Will You Finish Don Quixote?
他考虑过完成并称它为,《你什么时候完成堂吉诃德》
And after a while,somewhere the name spreads and by the time I'm 250 years old, everybody's calling me Jo-Jo.
一段时间之后这个名字传开,当我250岁时,大家都叫我Jojo了。
I'm calling it a growing consol even though the British consols didn't grow.
即使英国债券并不升值,我还是要称之为上涨债务
So, I'm now multiplying by the result of calling the size of operator, which we've seen before.
现在我乘以运算符的大小,之前我们看到的。
OK. I'm calling palindrome with that.
它先访问了这个问题。
printf Well, notice I'm calling print F with percent C, and then I'm printing out each of these letters one at a time.
好的,请注意我用%c来调用,然后我打印出一个一个打印出这些字符。
I'll draw something from the distribution, so this is interesting, distribution I'm now calling self dot distribution, and remember this will be different for each stock.
我会从分布中读取一个值,这就是有趣的部分,我现在会调用self。,请记住每只股票都是不一样的。
increment Well, here, I'm calling my own function, increment.
这里,我调用我自己的函数。
In 1957, they reformulated it and they called it the Standard & Poor 500, but I'm using their long theories, back to 1871, so I can't call it the 500; I'm calling it the Composite.
在1957年,他们将其重建,并命名为标准普尔500指数,但这里用到的是1871年发布的理论,所以不能称之为500,我称之为综合指数
If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?
如果我用归并排序算法,对N个元素其运行时间,就等于此算法一半元素的运行时间,另一半的运行时间,再加上N,这个N是什么呢?
应用推荐