Java入门 Day05
冒泡排序
package array;
import java.util.Arrays;
public class ArrayDemo06 {
public static void main(String[] args) {
int[] a = {12111,2232,32321,454,32,342,22,2,34,5,3,1};
System.out.println("排序前:");
System.out.println(Arrays.toString(a));
int[] sort = sort(a);
System.out.println("排序后:");
System.out.println(Arrays.toString(sort));
}
public static int[] sort(int[] array){
int temp = 0;
for (int i = 0; i < array.length-1; i++) {
boolean flag = false;
for (int j = 0; j < array.length-1-i; j++) {
if(array[j] > array[j+1]){
temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
flag = true;
}
}
if (flag == false) {
break;
}
}
return array;
}
}