05-05-2016 00:11

The article presents a discussion of most sorting algorithms. The Quick sort algorithm is selected as the best algorithm, because it has a minimum of run time and number of comparisons. The new algorithm based on the quick sort algorithm. The new algorithm based on the classification of the original unsorted group into N sub-groups. The classification process depended on a pivot element. The pivot element depended on the mathematical average of the original group. The main condition of the classification process is: Any item in the first sub-group less than any item in the second sub-group, any item in the second sub-group less than any item in the third sub-group, and so on. From the experimental results, we get the following: when the number of unsorted items less than 15000 items and the number of sub-groups equal to 8-sub-groups the quick sort algorithm is the best. Other wise the new algorithm is the best in all cases. When the number of sub-groups equal to 5-sub-groups, the new algorithm is bests.