快速排序的主要思想：找出数组的第一个数字作为参照物，从数组第一个数字往后开始比较，同时，从数组最后一个数字往前比较，如果前面的数字比参照值大，找出来，后面的数字比参照值小找出来，他们相互交换位置，当他们相遇了，停止。这样的结果是，相遇点的前面的数字都是比参照值小的，相遇点后面的值都是比参照值大，然后再相遇点分割成两块，各自进行刚才的操作。-The main idea of the quick sort: find the first number as a reference, the array from an array of the first number back to start, at the same time, the last digit from an array, forward if the previous number larger than the reference value, find out, the number after the smaller than the reference value, they exchange position, when they met, stop. As a result, the front of the meeting point of the Numbers are smaller than the reference value, the meeting point at the back of the values are larger than the reference value, and then meet some split into two pieces, to just their work.