This article presents a new sorting algorithm that has the ability to sort huge unsorted data. The quicksort algorithm was selected as the best algorithm, because it has a minimum of run time and number of comparisons. The proposed algorithm in this article adapted the quicksort algorithm. The new algorithm classifies the original unsorted group into M subgroups. The classification process used a pivot element. This element depended on the mathematical average of the original group to classify the subgroups. From the experimental results, it was found that the proposed algorithm is the best in all studied cases, where the complexity is comparisons, and N is the length of unsorted group.