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.