Java冒泡排序
package com.Mubai;
import jdk.nashorn.api.tree.ForInLoopTree;
public class MaoPao {
public static void main(String[] args) {
int[] a={21,34,83,67,12,4,122,66};
//冒泡排序
System.out.println("排序前的数组元素:");
for(int n:a){
System.out.print(n+" ");
}
System.out.println();
int temp;
for(int i=0;i<a.length-1;i++){
//内重循环控制每趟排序
for(int j=0;j<a.length-i-1;j++){
if(a[j]>a[j+1]){
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
System.out.println("排序后的数组元素:");
for(int n:a){
System.out.print(n+" ");
}
}
}