1.冒泡程序 : 2.选择排序:
package sorting; package sorting;
public class SortingTest1 { public class SortingTest2 {
public static void main(String[] args) { public static void main(String[] args) {
int[] numb=new int[]{6,40,58,2,36,27}; int[] numb=new int[]{6,40,58,2,36,27};
int len=numb.length; int len=numb.length;
int i,j; int temp; int i,j; int temp;
System.out.println("排序前的数组各个值:"); for(i=0;i<numb.length-1;i++)
for(i=0;i<len;i++) { {
System.out.print(numb[i]+"\t"); int min=i;
} for(j=i+1;j<numb.length;j++)
System.out.println("\n"); {
for(i=1;i<=len;i++) { if(numb[min]>numb[j])
for(j=len-1;j>=1;j--) { {
if(numb[j]>numb[j-1]) { min=j;
temp=numb[j]; }
numb[j]=numb[j-1]; }
numb[j-1]=temp; temp=numb[min];
} numb[min]=numb[i];
} numb[i]=temp;
} }
System.out.println("排序后的数组各个值:"); }
for(i=0;i<len;i++) { }
System.out.print(numb[i]+"\t");
}
}
}
3.插入排序:
package sorting;
public class SortingTest3 {
public static void main(String[] args) {
int[] numb=new int[]{6,40,58,2,36,27};
int len=numb.length;
int i,j; int temp;
for(i=1;i<=len;i++) {
for(j=1;j<numb.length;j++
temp=numb[j];
i=j;
while(i>0&&numb[i-1]>=temp){
numb[i]=numb[i-1];
i--;
}
num[i]=temp;
}
for(i=0;i<numb.length;i++){
System.out.println(numb[i]+" ");
}
}
}