C程序排序问题的一种新算法

A New Sorting of C Language

文章针对一个最基本、最典型的排序问题,提出不同于已有排序方案的另一种思路,即半数元素整体移动和结束条件自由控制。并将此方法与常见的4种方法进行比较。

In view of one of the most primary and typical sorting problem, this paper brings out another new method , which is different from those subsistent methods. It refers to the whole shifting of half the elements and free controlling of terminal condition. And also, this new method is compared with another four usual methods.