学步园

package sort;</p> <p>public class QuickSort {<br /> public static void sort(int[] a, int low, int high){<br /> if(low>=high){<br /> return;<br /> }<br /> int low0 = low;<br /> int high0 = high;<br /> boolean forward = false;<br /> while(low0!=high0){<br /> if(a[low0]>a[high0]){<br /> int temp = a[low0];<br /> a[low0] = a[high0];<br /> a[high0] = temp;<br /> forward = !forward;<br /> }<br /> if(forward){<br /> low0++;<br /> }<br /> else{<br /> high0--;<br /> }<br /> }<br /> low0--;<br /> high0++;<br /> sort(a, low, low0);<br /> sort(a, high0, high);<br /> }</p> <p> public static void main(String[] args) {<br /> int[] a = new int[]{6,8,3,5,9,0,1,2,4,7};<br /> sort(a, 0, 9);<br /> for(int i=0; i<a.length; i++){<br /> System.out.print(a[i] + " ");<br /> }<br /> }</p> <p>}<br />

转载请注明来自：http://blog.csdn.net/sunxing007