快速排序（Quicksort）是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列-Quicksort (Quicksort) is to improve a bubble sort. By CAR Hoare in 1962. The basic idea is to split into two independent parts: a trip to the sort you want to sort data, part of all of the data than the other part of all of the data should be small, then the two parts of data by this method were quickly sort, the entire sorting process can be recursively, in order to reach the entire data into an ordered sequence