package bd_algo;
/**
* Created by Administrator on 2017/8/28.
*/
public class QS {
public static void main(String[] args) {
int[] nums = {3, 2, 1, 5, 4};
quickSort(nums);
for (int i = 0; i < nums.length; i++) {
System.out.println(nums[i]);
}
}
private static void quickSort(int[] nums) {
if (nums == null || nums.length == 0) {
return;
}
quickSortHelp(nums, 0, nums.length );
}
private static void quickSortHelp(int[] nums, int start, int end) {
if(end - start <= 1) return;
int key = nums[start];
int i = start;
int j = end - 1;
while (i < j) {
while (i < j && nums[j] >= key) {
j--;
}
if (i < j) {
nums[i++] = nums[j];
}
while (i < j && nums[i] <= key) {
i++;
}
if (i < j) {
nums[j--] = nums[i];
}
}
nums[i] = key;
quickSortHelp(nums, start, i);
quickSortHelp(nums, i + 1, end);
}
}
快排
最新推荐文章于 2020-10-20 00:36:07 发布