import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class LoveWho {
public static void main(String[] args) {
int [] arr = {4,45,886,41,3,42,1,20,58,34,48,31};
//int [] arr2 = {213,432,6756,45,543,6,36,15,86,24,634};
//Bubble sort for Ascending
List<Integer> list = new ArrayList<>();
for (Integer i: arr) {
list.add(i);
}
Collections.sort(list);
for (Integer i: list) {
System.out.print(i+",");
}
/* for (int i = 0; i < arr.length; i++) {
for (int j = i+1 ; j < arr.length ; j++) {
int car = 0;
if(arr[i]>arr[j]){
car = arr[i];
arr[i] = arr[j];
arr[j] = car;
}
}
}
for (int i : arr) {
System.out.print(i+",");
}*/
java 冒泡排序(Buddle Sort),两种简易实现
猜你喜欢
转载自blog.csdn.net/XuHang666/article/details/80144098
今日推荐
周排行