1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
|
public static void sort(int[] A, int i, int j){
int help;
if(A[i] > A[j]){
help = A[i];
A[i] = A[j];
A[j] = help;
}
if(i+1 >= j){
return;
}
int k = (j-i+1)/3;
sort(A, i, j-k);
sort(A, i+k, j);
sort(A, i, j-k);
} |