JAVA编程实现对数组{25.24.12.76.101.96.28}的排序。使用冒泡排序算法 java编程，对给定一整型数组，用冒泡排序算法按从大到小的顺...

import java.util.Arrays;

public class BubbleFinal {
public static void main(String[] args) {
int[] arr ={25,24,12,76,101,96,28};
sortFinal(arr);

}

public static void sortFinal(int[] arr) {
boolean sorted = true;
for (int j = 0; j < arr.length - 1; j++) {
sorted = true;
System.out.println("第" + (j + 1) + "趟\t");
for (int i = 0; i < arr.length - 1 - j; i++) {
if (arr[i] > arr[i + 1]) {
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
sorted = false;
}
System.out.println("第" + (i + 1) + "次" + Arrays.toString(arr));
if (sorted) {
break;
}
}
}
}｝

java编程中 对int[]a={25.24.12.76.98.101.90.28}数组进行冒泡~

int a[] = {45, 23, 18, 10, 6, 8, 67, 98, 30, 50}; //泡沫排序法 for (int i=0;ia[j]) { int temp = a[j+1]; //交换阵列元素 a[j+1]=a[j]; a[j]= temp; } } } for (int i=0;i<a.length;i++) System.out.print(a[i]+" | "); System.out.println("
= = = = = = = = = = = = = ="); int max = a[0]; int min = a[a.length-1]; System.out.println("本阵列最大值= "+max+"
本阵列最小值= "+min);

public class Test
{
public static void main(String args[])
{
int[] arr = {4, 1, 2, 6, 3, 8, 9, 10, 7, 5};

for (int i = 0; i < 10; i++)
System.out.print(arr[i] + " ");
System.out.println();

for (int i = 0; i < 10 - 1; i++)
for (int j = 0; j < 10 - 1 - i; j++)
{
if (arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
for (int i = 0; i < 10; i++)
System.out.print(arr[i] + " ");
}
}