两种冒泡排序,代码如下:
package com.sinosoft.credit.util.web;
public class TestSort {
public static void main(String[] args) {
Integer[] arr = new Integer[5];
arr[0] = 123;
arr[1] = 12;
arr[2] = 23;
arr[3] = 13;
arr[4] = 32;
for(Integer ii:arr){
System.out.print(ii+" ");
}
System.out.println();
for(Integer ii:founction1(arr)){
System.out.print(ii+" ");
}
System.out.println();
for(Integer ii:founction2(arr)){
System.out.print(ii+" ");
}
}
//将最大的放到最前面
public static Integer[] founction1(Integer[] arr){
for(int i = 0;i<arr.length;i++){
for(int j = i+1;j<arr.length;j++){
if(arr[i]<arr[j]){
Integer temp = arr[j];
arr[j] = arr[i];
arr[i] = temp;
}
}
}
return arr;
}
//将最小的放到最后
public static Integer[] founction2(Integer[] arr){
for(int i = 0;i<arr.length;i++){
for(int j = 0;j<arr.length-i-1;j++){
if(arr[j]<arr[j+1]){
Integer temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
return arr;
}
}