A quick sort of sorting algorithm

The basic idea of the sorting algorithm

Through a sort of sorting records to be sorted into separate two parts, some of the records of the keywords are smaller than the other part of the keyword, you can separate the two parts of the record to order, has reached the order of the whole sequence.

The following is the subway on the one-hour dictation of the algorithm implementation, in PHP to test the order 180,000 of the data need 1.3 seconds, but the use of the sort () function only 0.045 seconds, the gap is still very large, there is a great space to optimize.

A quick sort of sorting algorithm