A new construct method of self-shrinking sequence is presented, the period and the linear complexity of sequences generated by the new method is give.

造自缩减序列的新方法，给出了这种方法产生的自缩减序列的周期和线性复杂度。

youdao

I've got to count my way down, which means that the access would be linear in the length of the list to find the I 'th element of the list, and that's going to increase the complexity.

的位置并去访问，然后继续下去，也就意味着，找到数组中的第i个元素的方法，是关于数组的长度呈线性复杂度的，这回增加算法的复杂度。

youdao

Simultaneously, the sequences have a large period and high linear complexity.

同时广义互缩序列具有大的周期和高的线性复杂度。

youdao

Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.

这里的复杂度不再是对数的了，因为每次在列表中，查找需要线性访问,可能还要糟糕,其实，有些编程语言，如。

麻省理工公开课 - 计算机科学及编程导论课程节选

In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.

复杂度是多少？k的n次方，对吧？,在序列n中做搜索，要做k次，所以是k的n次方次,如果先排序后搜索。

麻省理工公开课 - 计算机科学及编程导论课程节选