冒泡排序
//元素两两相比
int[] a = {7,2,3,1,5,4,6};
for (int j = 0; j < a.length; j++) {
for (int i = 0; i < a.length-1-j; i++) {
if (a[i]>a[i+1]) {
int t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
}
选择排序
//取一个元素与后面的每一个元素相比
int[] a= {5,3,7,2,8};
for (int i = 0; i < a.length-1; i++) {
for (int j = i+1; j < a.length; j++) {
if (a[i]>a[j]) {
int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}