摘要
阐述了在对无序线性表进行访问的同时，动态地逐步完成排序的算法设计思想，并以两种典型的算法分析了其可行性及性能．
This paper sets forth an idea of algorithm design that while an unorder linear- list is accesed, dynamically, gradually ordering be complete, and take two typical algorithm analyzed its feasibility and property.
出处
《云南大学学报（自然科学版）》
CAS
CSCD
1998年第S2期327-330,共4页
Journal of Yunnan University(Natural Sciences Edition)
关键词
线性表
访问
动态排序
linear - list, access, dynamic ordering
