package array;
import java.util.Arrays;
public class ArrayDemo06 {//冒泡排序,时间复杂度为O(n^2)
public static void main(String[] args) {
int[] a={5,91,7,86,3,2,4,7,61,2,1};
System.out.println(Arrays.toString(array(a)));
}
public static int[] array(int[] array){
int temp;
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;
}
}
Java冒泡排序
最新推荐文章于 2024-06-15 16:17:24 发布