快速排序法 java实现

**
 * @author: zsg
 * @description: 快速排序法 
 * @date: 2018/6/8 15:25
 * @modified:
 */
public class demo6 {

    public static void main(String[] args) {
        int[] arr = {2,4,1,2,3,5,4,5,8,1,3,6,5,2,7,9,7};
        Qsort(arr, 0, arr.length - 1);

        for (int i = 0; i =pivot){
               --height;
           }
           //如果条件成立就把low的换成height
           if (low

加入群聊  602640939

--------------------------------------------------------------------------------------------------------