代码:
public class Test {
public static void main(String[] args) {
int[]arr= {2,1,4,5,3,3};
divide(arr);
}
private static void divide(int[] arr) {
//递归终止的条件,即当分到只有一个元素时停止递归
int len=arr.length;
if(len==1)
return;
//每一次递归都会把一个数组分割为两个数组,所以用两个临时数组存储值并打印到控制台,并用t1,t2分别表示其索引
int[] temp1;
int[] temp2;
int t1=0;
int t2=0;
//数组大小为偶数和奇数时(如果为奇数,比如5,则temp1大小为3)
if(len%2==0)
temp1=new int[len/2];
else
temp1=new int[len/2+1];
temp2=new int[len/2];
for(int i=0;i<len;i++) {
if((len%2)==0?i<len/2:i<=len/2) {
temp1[t1]=arr[i];
t1++;
}
else {
temp2[t2]=arr[i];
t2++;
}
}
System.out.print("左边:"+Arrays.toString(temp1)+"\t");
System.out.println("右边:"+Arrays.toString(temp2));
divide(temp1);
divide(temp2);
}
}
输出: