冒泡排序

// int array[] ={1,45,78,96,58,96,74,12,2,10};
Scanner input2 = new Scanner(System.in);
int[] array = new int[10];
for (int k = 0; k < array.length; k++) {
array[k] = input2.nextInt();
}
for (int k2 = 0; k2 < array.length-1; k2++) {
for (int m = 0; m < array.length-1-k2; m++) {
if (array[m]>array[m+1]) {
int temp=array[m];
array[m] = array[m+1];
array[m+1] = temp;
}
}
}
for (int m = 0; m < array.length;m++) {
System.out.println(array[m]);

        }