1.效果
2.代码
package StringBuffer;
/**
*冒泡排序
* 将数组中的数字进行排序输出最大值及最小值
*
*/
public class MaoPaoPaiXu {
public static void main(String[] args) {
int[] a={15,2,55,46,265,45,456,42};
System.out.println("遍历前:");
bianLiShuZu(a);
System.out.println("--------------------------------");
int[] ax = maoPaoPaiXu(a);
System.out.println("遍历后:");
bianLiShuZu(ax);
System.out.println("最小值:"+ax[0]);
System.out.println("最大值:"+ax[ax.length-1]);
}
/**
* 1.遍历int 类型的数组
*/
public static void bianLiShuZu(int[] a){
System.out.print("[");
for (int i = 0; i < a.length; i++) {
if(i==a.length-1){
System.out.print(a[i]);
}else{
System.out.print(a[i]+", ");
}
}
System.out.println("]");
}
/**
* 2.冒泡排序
* @param a
* @return
*/
public static int[] maoPaoPaiXu(int[] a){
for(int x=0;x<a.length;x++){
for(int y=0;y<a.length-1-x;y++){
if(a[y]>a[y+1]){
int temp=a[y];
a[y]=a[y+1];
a[y+1]=temp;
}
}
}
return a;
}
}