java冒泡排序，选择排序

package test;




import java.util.Arrays;


import org.junit.Test;


public class jT {
@Test
public void test2(){
int[] dArr=new int[9];
dArr[0]=2;
dArr[1]=78;
dArr[2]=5;
dArr[3]=45;
dArr[4]=9;
dArr[5]=888;
dArr[6]=38;
dArr[7]=7;
dArr[8]=1;
System.out.println("^^^^^^^^^^^冒泡排序^^^^^^^^^^^");

                  //冒泡排序
for (int i = 0; i < dArr.length; i++) {
for (int j = 0; j < dArr.length - 1 - i; j++) {
if (dArr[j] > dArr[j + 1]) {
int temp = dArr[j + 1];
dArr[j + 1] = dArr[j];
dArr[j] = temp;
}
}
}
System.out.println(Arrays.toString(dArr));

System.out.println("%%%%%%%%选择排序%%%%%%%");
for(int i=0;i<dArr.length-1;i++){
for(int j=i+1;j<dArr.length;j++){
if(dArr[i]>dArr[j]){
int tmp=dArr[i];
dArr[i]=dArr[j];
dArr[j]=tmp;
}
}
}
System.out.println(Arrays.toString(dArr));
}
}