通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。用迭代和递归两种算法来实现快速排序。(The trip will be the two part sort sort data into independent, a part of all of the data are all data than another to be a small part, and then according to the method of the two part of the data were quick sort, the sorting process can be performed recursively, in order to achieve the data into an ordered sequence.)