基于数据结构的选择排序算法剖析与改进  

Research on Sorting Selective Algorithm Based on Data Structure

作　　者：李崇[1] 

机构地区：[1]重庆工程职业技术学院,重庆400037

出　　处：《现代电子技术》2010年第6期84-86,共3页Modern Electronics Technique

摘　　要：排序在数据处理中起着非常重要的作用。选择排序算法是数据结构中的一种基本的排序算法,运用极其广泛。这里对基本选择排序的算法进行剖析,继而提出一种改进的思路,形成改进型的选择排序。其特点是在比较的过程中将被交换数据的下标进行保存,在选择下一个目标时只需在最后一次交换的位置与待排纪录之间进行,从而大大地减少了比较的次数。从时间复杂度、空间复杂度与稳定性进行比较,体现出其优越性能。Sorting plays an important role in data processing. The widely used selective algorithm is a basic sorting way in the data structure. This research analyses the basic selective sorting algorithm, promotes improving ways, determines an improved selective sorting way. In this way the number of comparison is greatly reduced because only the subscript of the trans- ferred data is stored in the process of comparison,and the next object is chosen between the last transferred and the to - be - sorted data, This research also compares them in time complexity, space complexity and stability,and presents excellent performance of the improved way.

关 键 词：选择排序 算法 时间复杂度 空间复杂度 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]