简易冒泡排序
public class MaoPao{
public static void main(String[] args) {
int[] arr = {21,73,84,56,10};
int temp=0;//过渡变量
for(int i = 0;i < arr.length - 1;i++){
for(int j = 0;j < arr.length- 1 - i;j++)
{
if(arr[j]>arr[j+1])
{
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
System.out.println("\n"+"第"+(i+1)+"轮排序后的结果:");
for(int m = 0;m < arr.length;m++)
{
System.out.print(arr[m]+"\t");
}
}
}
}
运行结果