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

线性表顺序和链式存储的对比分析
引用本文:杨智明,夏文忠.线性表顺序和链式存储的对比分析[J].保山学院学报,2010(5):55-57.
作者姓名:杨智明  夏文忠
作者单位:保山学院计算机科学系
摘    要:顺序和链式存储是线性表不同的存储方式,它们各有优劣,存储方式不同,所对应的算法操作也不同,实现的效率也有差异。通过对两种存储方式及三种基本操作进行对比分析,加深学习者对线性表存储结构与对应算法关系的理解,学会对时空效率的权衡,使用户能选择合适的存储结构和算法,以满足自己的需求。

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

Linear order and chain store table compared
Institution:Yang Zhiming;Xia Wenzhong(Computer science Dept.Baoshan College,Baoshan,Yunnan,678000)
Abstract:Order and chain store is the linear form of different storage methods,which have advantages and disadvantages,stored in different ways,corresponding to the arithmetic operations are also different,there are differences in the efficiency of implementation.Through the two storage and comparative analysis of three basic operations,enhance learners table storage structure of linear understanding of the relationship with the corresponding algorithms,learn to balance time and space efficiency,so the user can select the appropriate storage structures and algorithms to meet their needs.
Keywords:linear form  order of storage  chain store  algorithm
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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