摘要
排序是计算机程序设计中的一种重要操作,在现有的排序方法中,多数情况都是对数据原始排列顺序的一种破坏,一旦进行了排序,数据原始存储顺序就发生了改变,若想再基于数据原始排列顺序进行其他操作也就困难了。排序只是对数据的一种分析手段,对数据记录并不需要一定将其排列有序,只需要对它做好排序准备,在需要排序时再进行排序操作。文中基于应用对选择法排序做了改进,同时,在选择法一次只能选一个的基础上,提高成一次可以确定两个记录,这样也提高了排序效率。
An improved algorithm is discussed based on selection sorting but without moving any data. Sorting is one kind of important operation in the computer programming. In existing sorting methods, they all destroy the data sequence. Once sorted, the primary data sequence in computer memory will be changed. It will be difficult when the other operations based on the primary data sequence is done. While, sorting is an analysis method to the data. It is not important for us to make the original data in order. To get ready for data sorting, the improved sorting operation can be done.
出处
《科学技术与工程》
2009年第1期139-142,共4页
Science Technology and Engineering
关键词
数据结构
排序
选择
data structure sort selection