1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58
|
public class alg2 { public static void main(String[] args) { int[] nums = {49,38,65,97,76,13,27}; quickSort(nums, 0, nums.length-1); System.out.println(java.util.Arrays.toString(nums)); }
public static void quickSort(int[] data,int start ,int end){ int i = start; int j = end; if(i >= j){ return; } boolean flag = true; while (i!=j){ if(data[i] >data[j]){ int temp = data[i]; data[i] = data[j]; data[j] = temp; flag = (flag ==true) ? false : true ; } if(flag) { j--; }else{ i++; } } i--; j++; quickSort(data,start,i); quickSort(data,j,end); } }
|