3-Points Average Pivot Quicksort

In the absence of a sorting algorithm faster than O(nlogn), Quicksort remains the best and fastest of its kind in practice. For given n data, Quicksort records running in O(nlogn) at best and O(n^{2}) at its worst. In this paper, I propose an algorithm by which 3-points average is set as a pivot for first array L=a[s], last array H=a[e], and middle array M=a[?(s+e)/2?]in order to find the more fast than Quicksort. Test results prove that the proposed 3-points average pivot Quicksort has the time complexity of O(nlogn)at its best, average, and worst cases. And the proposed algorithm can be reduce the O(n^{2}) time of Quicksort to O(nlogn).