//数组--冒泡排序法
public class TestArray6 {
public static void main(String arge[]){
int i,j,temp;
int[] arr1=new int[]{7,4,66,22,14,88};//定义数组
System.out.print("数组arr1的原始顺序是:");
for(i=0;i<arr1.length;i++){
System.out.print(arr1[i]+"\t");
}
System.out.println();
//进行排序
for(i=0;i<arr1.length;i++){
for(j=i+1;j<arr1.length;j++){
if(arr1[i]>arr1[j]){
temp=arr1[i];
arr1[i]=arr1[j];
arr1[j]=temp;
}
}
System.out.print("数组arr1的经冒泡排序后是:");
for(i=0;i<arr1.length;i++){
System.out.print(arr1[i]+"\t");
}
}
}
}
public class TestArray6 {
public static void main(String arge[]){
int i,j,temp;
int[] arr1=new int[]{7,4,66,22,14,88};//定义数组
System.out.print("数组arr1的原始顺序是:");
for(i=0;i<arr1.length;i++){
System.out.print(arr1[i]+"\t");
}
System.out.println();
//进行排序
for(i=0;i<arr1.length;i++){
for(j=i+1;j<arr1.length;j++){
if(arr1[i]>arr1[j]){
temp=arr1[i];
arr1[i]=arr1[j];
arr1[j]=temp;
}
}
System.out.print("数组arr1的经冒泡排序后是:");
for(i=0;i<arr1.length;i++){
System.out.print(arr1[i]+"\t");
}
}
}
}