静态单链表存储结构算法分析

The method of memory-mapped in static linked List

国内有关《数据结构》的教材和参考书很少对静态单链表的存储结构算法进行研究 ,但随着计算机信息的发展 ,在线性数据结构数据信息的存储印象 (结构 )中 ,静态单链表充分综合并应用了静态顺序存储结构和链式存储结构的优点 ,不失为一种算法较为优秀。

In the data structure of list, static linked list is a excellent method in memory-mapped .It makes use of good qualities of linked list and sequential storage list. Its main method is keeping the current(the next element) position. It will be explored in this paper.