OpenUP将项目划分为迭代:有计划的、有时限的迭代操作,通常以周为单位。
OpenUP divides the project into iterations: planned, time-boxed intervals typically measured in weeks.
那么,您会了解到所有的列表均有一个基本的操作:迭代。
So, you know that all lists have one basic operation: iteration.
状态通过 initial-state 预设,并在整个迭代过程中传递,允许访问者函数按照所需的任何方式操作状态。
The state is primed with initial-state and passed throughout the iteration, allowing the visitor functions to manipulate it in whatever way they desire.
We saw some quadratic algorithms, typically those are things with multiple nested loops, or iterative or recursive calls, where you're doing, say, a linear amount of time but you're doing it a linear number of times and so it becomes quadratic, and you'll see other polynomial kinds of algorithms.
我们看过一些平方算法,他们一般进行了多次嵌套循环,或者递归迭代调用,对一个线性操作调用线性次,这样就变成平方次了,以后你们能看到,一些多项式算法。
And in this case, we go from 8 to 4 to 2 to 1 three times and then on each iteration of this algorithm, each pass across the board I'm touching N numbers, so that means I'm doing N things, log N times.
在这个例子中,我们从8得到4,到2,再到1,是3次,在这个算法的每次迭代中,每一趟我都会操作N个数,也就是所我每次要做N步操作,一共要做,log,N,次。
应用推荐