1、冒泡算法
int[] ints = {32,3,56,22,25,19,9,0,17,4,6,8,2};
int i, j;
for (i=0; i<ints.length; i++){
for (j = 1; j<ints.length -i; j++){
if (ints[j-1]>ints[j]){
int temp;
temp = ints[j-1];
ints[j-1] = ints[j];
ints[j] = temp;
}
}
}
for (i=0; i<ints.length; i++){
System.out.print(ints[i]+",");
}
2、插入排序算法
int[] ints = {32,3,56,22,25,19,9,0,17,4,6,8,2};
int i;
for (i=1; i<ints.length; i++){
int insertValue = ints[i];
int index = i-1;
while (index>=0 && insertValue<ints[index]){
ints[index + 1] = ints[index];
index--;
}
ints[index+1] = insertValue;
}
for (i=0; i<ints.length; i++){
System.out.print(ints[i]+",");
}
3、