java ÅÅÐòÎÊÌâ

ÀýÈç:Ò»¸öÕûÐÍÊý×éa[]={1,3,3,5,7,4,2,6,8};
ÅÅÐò(ÉýÐò)ºó:a[]={1,2,3,3,4,5,6,7,8};
ÅÅÐòǰϱêΪ: 0 1 2 3 4 5 6 7 8
ÅÅÐòºóԭϱêΪ:0 6 1 2 5 3 7 4 8»ò0 6 2 1 5 3 7 4(Çó³öÈÎÒâÒ»¸ö¼´¿É)

---

ʹÓÃTreeSetÅÅÐò

---

Â¥ÉÏ Õý½â...

---

Java code:

public class ArraysSort {
public static void main(String[] args) {
int[][] a = new int[2][];
a[0] = new int[]{1,3,3,5,7,4,2,6,8};
a[1] = new int[a[0].length];
for(int i=0; i<a[1].length; i++) {
a[1][i] = i;
}

sort(a);

for(int i=0; i<a[1].length; i++) {
System.out.print(a[1][i] + "\t");
}
}

public static void sort(int[][] a) {
for(int i=0; i<a[0].length-1; i++) {
int changeIndex = i;
for(int j=i+1; j<a[0].length; j++) {
if(a[0][changeIndex] > a[0][j]) {
changeIndex = j;
}
}
if(i != changeIndex) {
a[0][i] ^= a[0][changeIndex];
a[0][changeIndex] ^= a[0][i];
a[0][i] ^= a[0][changeIndex];

a[1][i] ^= a[1][changeIndex];
a[1][changeIndex] ^= a[1][i];
a[1][i] ^= a[1][changeIndex];
}
}
}
}