类名:BubbleSort
import java.util.Scanner;
public class BubbleSort {
/**
* 冒泡排序算法
*/
public static void main(String[] ags){
Scanner input = new Scanner(System.in);
System.out.println("请输入数组长度");
int size = input.nextInt();
int[] array = new int[size];
int i = 0;
while(i<array.length){
System.out.print("请输入第" + (i +1) + "个数:");
array[i] = input.nextInt();
i++;
}
//排序前数组内容
System.out.println("排序前数组内容");
for(int j=0;j < array.length;j++){
System.out.println(array[j] +" ");
}
System.out.println();
//排序
for( int m = 0 ; m < array.length - 1; m ++){
for(int n = 0; n<array.length -m -1;n++){
if(array[n] > array[n+1]){
int temp = 0;
temp=array[n];
array[n]=array[n+1];
array[n+1] = temp;
}
}
}
System.out.println(" 排序后数组内容 ");
for(int j = 0 ; j <array.length; j ++){
System.out.print(array[j] + " ");
}
}
}