一、选择法排序(当前位和其他位依次比较)
例:
public class Paixu{
public static void main (String[] args){
int a[] = {18,62,68,82,65,9};
arraySort1(a);
}
public static void arraySort1(int a[]) {
for (int i=0; i<a.length-1; i++){
for (int j<i+1; j<a.length; j++) {
if (a[j]<a[i]) {
//大于号小于号分别表示从大到小和从小到大排序
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
for (int i:a) {
System.out.print(i+" ");
}
System.out.println();
}
}
二、冒泡法排序(俩俩比较)
public class Paixu{
public static void main (String[] args){
int a[] = {18,62,68,82,65,9};
arraySort2(a);
}
public static void arraySort2(int a[]) {
for (int i=0; i<a.length; i++){
for (int j=0; j<a.length-i-1; j++) {
if (a[j]<a[i]) {
//大于号小于号分别表示从小到大和从大到小排序
int temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
for (int i:a) {
System.out.print(i+" ");
}
System.out.println();
}
}