package algorithmAndExercise;
import java.util.Arrays;
public class QuickSort {
public static void sort(int[] ints,int from,int to){
if(ints.length=to)
return;
while(i=index&&j>i){
j--;
}
//æ¤æ—¶ï¼Œints[i]çš„ä½ç½®ä¸Šå…¶å®žå°±æ˜¯index值，将indexä½ç½®ä¸Šçš„值å˜æˆindex[j]
if(ints[j]index)
ints[j]=ints[i];
}
//一轮比较åŽï¼Œå°†åŸºå‡†çš„å‰åŽçš„队列分别进行比较
ints[i]=index;
//这边注æ„ä¸èƒ½æ˜¯i--，
sort(ints, from, i-1);
sort(ints, i+1, to);
}
public static void main(String[] args) {
int[] ints={2,5,3,7,12,56};
sort(ints, 0, ints.length-1);
System.out.println(Arrays.toString(ints));
}
}