与基于变换存储结构的一种高效排序算法的商榷  

The Discussion of Algorithm on a High Performance by Storage Structure

作　　者：温丽萍[1] 

机构地区：[1]山西大学工程学院基础部,山西太原030013

出　　处：《太原师范学院学报（自然科学版）》2006年第1期45-47,共3页Journal of Taiyuan Normal University:Natural Science Edition

摘　　要：作为计算机应用中一项复杂而重要的技术,排序一直是计算机领域内人们感兴趣的课题,寻找速度快、附加存储空间开销小的高效排序算法也一直是计算机工作者为之追求的目标.对变换存储结构的一种高效排序算法中所存在的几个问题进行商榷与讨论.并证明了建立/生成一棵含有n个数据元素的二叉排序树,其时间复杂度最小为O(n log2n).The complicated and important technology of computer uses, to order is the subject of people interested in the computer field,and it is that a pursue goal of computer worker, the goal is to look for high performance algorithm that speed quickly and small space of additional storage, discuss and discuss to several questions of high performance algorithm on vary storage structure, and proved to set up/produced a binary sort tree of date element, the time complexity is O（n log2n）.

关 键 词：排序 存储结构 二叉排序树 时间复杂度 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]