20行代码搞定JAV快排

package test.util;

import com.alibaba.fastjson.JSON;

import java.util.LinkedList;
import java.util.List;

/**
* Created by beibei on 17/11/10.
*/
public class QuickSort {

public static void main(String[] args) {
    int[] test = {32, 121, 45, 11, 44, 21, 454, 67, 21, 1};
    sort(test, 0, test.length);
    System.out.println(JSON.toJSONString(test));
}

private static void sort(int[] param, int start, int end) {
    if (start + 1 >= end)
        return;
    List left = new LinkedList<>();
    List right = new LinkedList<>();
    int temp = param[start];
    for (int i = start + 1; i < end; i++) {
        if (param[i] < temp)
            left.add(param[i]);
        else
            right.add(param[i]);
    }
    for (int i = 0; i < left.size(); i++) {
        param[i + start] = (int) left.get(i);
    }
    for (int i = 0; i < right.size(); i++) {
        param[start + left.size() + i + 1] = (int) right.get(i);
    }
    param[left.size() + start] = temp;
    if (left.size() > 1)
        sort(param, start, start + left.size());
    if (right.size() > 1)
        sort(param, start + 1 + +left.size(), end);
}

}

你可能感兴趣的:(设计模式及算法)