摘要
本文提出了一个可以再现和不可再现随机过程的生成算法,并从算法复杂性对其作了论证。其中所用的对一类线性表进行检索的算法,其时间复杂性不依赖于表的长度,而只依赖于各元素相对于基底的分布状态。
Algorithm for generation of reappearable and irreappearable random
process is described and the algorithm's complexity is analysed here.
Especially, a new algorithm is introduced for searching a kind of linear
list, its time complexity does not depend on the length of linear list,
but tbe distribution status of all elements.
关键词
计算机
随机过程
算法设计
Computer
Algorithm design
Random process
