一种新的数组排序法

A New Algorithm for Array Sorting

提出一种新的数组排序法 ,分析了该算法在最坏情况下的计算复杂度。该算法比C .A .R .Hoare算法要快 。

This paper presents a new algorithm for array sorting and an analysis of its complexity of calculation in the worst situation. This algorithm is simple in operation and can run more quickly than C.A.R Hoare's Quichsort algorithm.