The principle is quick to sort out the first number, the entire array will be divided into two groups, one group is greater than the number of the other group are less than this number, and then recursive in the same way in the first set of figures and Second set of figures. That is “fast sort,” affirmed the efficiency of the general than other high-ranking algorithm, we have the following to verify, and compare the so-called “quick sort” and the “bubble sort of” performance differences.