摘要
给出一种时间复杂度为O(n)的一维数组循环移动的高效算法,并给出用PASCAL语言实现的方法及技巧。
A high efficiency algorithm on which asymptotic time complexity is O(n) on loopy moving of array element is given in this paper, and some skills and techniques are provided with Pascal language.
出处
《菏泽学院学报》
2003年第2期80-81,共2页
Journal of Heze University
关键词
算法
循环移动
时间复杂度
O(n)
algorithm
loopy moving
asymptotic time complexity
O(n)
