大致思路:选中一个基准值,将小于基准值的数字移到左边数组,大于基准值的数字移到右边数组,
得到两个数组,进行递归操作,对两个无序子数组进行上述排序;
public class Sort {
public static void main(String[] args) {
int [] arr = {5,2,4,9,7,6};
List<Integer> list = Ints.asList(arr);
System.out.println(quickSort(list));
}
public static List quickSort(List<Integer> list){
if(list.size() < 2){
return list;
} else {
int a = list.get(0);
List<Integer> left = new ArrayList<>();
List<Integer> middle = new ArrayList<>();
List<Integer> right = new ArrayList<>();
for (Integer i : list) {
if(i < a){
left.add(i);
} else if(i == a) {
middle.add(i);
} else {
right.add(i);
}
}
List result = new ArrayList();
result.addAll(quickSort(left));
result.addAll(middle);
result.addAll(quickSort(right));
return result;
}
}
}