冒泡排序java简单实现
package com.peng;
import java.util.Arrays;
public class Demo02 {
public static void main(String[] args) {
int[] a = {1,3,23,2,5,6,345,34,234,5436,4747,35,2352,523,53};
System.out.println(Arrays.toString(sort(a)));
}
public static int[] sort(int[] array){
int temp = 0;
boolean flag = false;
for (int i = 0; i < array.length-1; i++) {
for (int j = 0; j < array.length-1-i; j++) {
if (array[j+1] < array[j]){
temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
flag = true;
}
}
if (flag == false){
break;
}
}
return array;
}
}