package 数组练习01;
import java.util.Arrays;
public class test02 {
///冒泡排序
public static void main(String[] args) {
// TODO Auto-generated method stub
int [] nums = {12,56,23,45,44,11};
System.out.println("原来的数组:");
for(int i =0;i<nums.length;i++) {
System.out.print(nums[i]+" ");
}
System.out.println();
System.out.println("排序(降序)后的数组");
for(int i =0;i<nums.length;i++) {
for(int j=0;j<nums.length-1-i;j++) {
if(nums[j]<nums[j+1]) {
int temp =nums[j];
nums[j] = nums[j+1];
nums[j+1] = temp;
}
}
System.out.print(nums[i]+" ");
}
//使用Arrays类中sort方法进行排序(升序)
System.out.println();
System.out.println("排序(升序)后的数组");
Arrays.sort(nums);
for(int num :nums) {
System.out.print(num+" ");
}
}
}