And the obvious question I could start with is, and suppose I ask you, how long does the algorithm implemented by this program take to run?
我开始这个话题的第一个问题是,假设我问你,由这个算法实现的程序大概,要运行多久才能给出答案?
achieve some of those goals, kind of, I guess, not to get into too much policy talk.
实现其中的一些目标,我想要做的不是一些政治上高谈阔论。
All right. What does this have to do with my divisor example? This says I can make tuples, but imagine now going back to my divisor example and I want to gather up the elements as I go along. I ought to be able to do that by in fact just adding the pieces in.
这意味着我可以创建元组了,但是想像下回到我们的除数的例子,在处理过程中我们想把目标数的除数,收集起来,我应该能够通过把这些数,一个一个加进来来实现这个目的,我正是要去这么做,也就是。
And that's what I came here to do is grow and build the,
我过来就是要做这些,来实现
What am I trying to accomplish in here?
我在这里究竟要实现什么价值
So this code is identical functionally nonswitch c to the last implementation we saw, nonswitch.c, but I'm just ever-more emphatically saying, "In case 1," that is when n equals 1 -- or when case 2 applies -- when n equals 2 or when n equals 3 do what?
所以这些代码到最后的实现上,功能是,完全相同的,但是我想要再次强调一下,“在case,1“,那是当n等于1时1,或者当case,2适用-,当n等于2或者当n等于3,它将做什么?
应用推荐