Abstract:
Sherwood algorithm is a kind of probability algorithm, After compari ng characteristic of linear list stored by sequential array and single linked li st, The paper puts forward a data structure ——Linked list simulating by array. And it proves that time complexity of search operation is O(n1/2) by it in theo ry. At last, the paper gives some data testing in computer.
摘要: 舍伍德算法是概率算法的一种,该文在比较了线性表的顺序存储与链式存储的特 点之后,提出了一种较优的数据结构——用数组模拟链表。理论上证明了采用舍伍德算法进 行查找运算的时间复杂度为O(n1/2),并在计算机上给出了相应数据的模拟。
关键词:
舍伍德算法,
概率算法,
查找
CLC Number:
LIU Jinglei, FAN Hui, FAN Baode. Quick Search of Linear List Using Sherwood Algorithm[J]. , 2004, 30(01): 181-.
刘惊雷,范辉,范宝德. 利用舍伍德算法实现线性表的快速查找[J]. , 2004, 30(01): 181-.