摘要
在分析选择排序算法后,给出了一种高效的排序方法。它可以使原来算法的执行时间大大降低。利用本排序方法,在每趟排序后,找到了当前待排序数据元素集合中的最大与最小者,然后再次对剩余的数据循环采用此方法,直到使所有数据有序。
Based on the analysis of choice - sorting algorithm, we find an efficient sorting method that can reduce the original sorting time. Using this method, after every sorting, we can find the largest and the smallest datum respectively among the collection of data elements to be sorted;then again sort the remained data by uses of this method until all the data become order.
出处
《黄河科技大学学报》
2009年第6期107-108,共2页
Journal of Huanghe S&T University