冒泡排序和选择排序

public class Sort { public static void sortArray(int[] oldArray){ int temp=0; for (int i = 0; i < oldArray.length-1; i++) { for (int j = 0; j < oldArray.length-i-1; j++) { if(oldArray[j] > oldArray[j+1]){ temp=oldArray[j]; oldArray[j]=oldArray[j+1]; oldArray[j+1]=temp; } } } showArray(oldArray,2); } public static void chooseSort(int[] oldArray){ int temp=0,num=0; for (int i = 0; i < oldArray.length-1; i++) { num=i; for (int j = i+1; j < oldArray.length; j++) { if(oldArray[num]>oldArray[j]){ num=j; } } if(num!=i){ temp=oldArray[i]; oldArray[i]=oldArray[num]; oldArray[num]=temp; } } showArray(oldArray,2); } public static void showArray(int[] array,int n){ if(n==1){ System.out.println("排序前的数组："); }else{ System.out.println("排序后的数组："); } for (int i = 0; i < array.length; i++) { System.out.print(array[i]+String.valueOf(" ")); } System.out.println(String.valueOf("\n")); } public static void main(String[] args) { int[] array=new int[10]; for (int i = 0; i < array.length; i++) { int newResult=(int)(Math.random()*100); int j; for (j = 0; j < array.length; j++) { if(newResult==array[i]){ break; } } if(j==array.length){ array[i]=newResult; } } showArray(array,1); chooseSort(array); }