快速排序

@Test
public void test5(){
int[] i = {25,4,5,7,18,21,23};
quickSort(i, 0 , i.length);
System.out.println(Arrays.toString(i));
}

private void quickSort(int[] array, int begin, int end){
int base = array[begin];
int index = begin;
for (int i = begin; i < end; i++){
if (array[i] < base){
array[index] = array[index] ^ array[i];
array[i] = array[index] ^ array[i];
array[index] = array[index] ^ array[i];
index++;
}
}
if(index > begin+1){
quickSort(array, begin, index);
}
if(index < end-1){
quickSort(array, index+1, end);
}
}