首页 | 本学科首页   官方微博 | 高级检索  
     检索      

线性表顺序和链式存储的对比分析
引用本文:杨智明,夏文忠.线性表顺序和链式存储的对比分析[J].计算机与农业,2010(11):140-141,148.
作者姓名:杨智明  夏文忠
作者单位:[1]保山学院计算机科学系,保山678000 [2]昭通师专网络中心,昭通657000
摘    要:顺序和链式存储是线性表不同的存储方式,各有优劣,而不同存储方式所对应的算法操作也不同,实现的效率也有差异。通过对两种存储方式及三种基本操作进行对比分析,加深学习者对线性表存储结构与对应算法关系的理解,学会对时空效率的权衡,使用户能选择合适的存储结构和算法。

关 键 词:线性表  顺序存储  链式存储  算法

Comparative Analysis on Linear List Order and Chain Stores
YANG Zhiming,XIA Wenzhong.Comparative Analysis on Linear List Order and Chain Stores[J].Computer and Agriculture,2010(11):140-141,148.
Authors:YANG Zhiming  XIA Wenzhong
Institution:1.Computer Science Dep.Baoshan College,Baoshan 6780002;.Network Center Zhaotong Teachers’College,Zhaotong 657000)
Abstract:Order and chain store is the linear form of different storage methods,each has advantages and disadvantages,stored in different ways,corresponding to the arithmetic operations are also different,there are also differences to achieve efficiency.Based on the two storage methods and comparative analysis of three basic operations,enhance learners table storage structure of linear understanding of the relationship with the corresponding algorithm,learn to balance time and space efficiency,allows users to select the appropriate storage structure and algorithms.
Keywords:linear list  order of storage  chain store  algorithm
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号