package rubbish; import java.util.ArrayList; import java.util.Collections; import java.util.List; public class Bogo { public static boolean isSort(List<Integer> list) throws Exception{ if(list == null || list.size() == 0) throw new Exception("错误的参数list"); boolean is = true; Integer sigh = list.get(0); for (int i = 1; i < list.size(); i++) { if(list.get(i) >= sigh){ sigh = list.get(i); }else{ is = false; break; } } return is; } public static void main(String[] args) throws Exception { List<Integer> list = new ArrayList<Integer>(); list.add(123); list.add(456); list.add(858); list.add(259); list.add(489); list.add(124); list.add(29); list.add(999); list.add(229); list.add(129); int index = 0; long first = System.currentTimeMillis(); while(!isSort(list)){ Collections.shuffle(list); index ++ ; } System.out.println("---------排序成功,输出结果如下--------第"+index+"次循环---------"); System.out.println(list); long end = System.currentTimeMillis(); System.out.println("总耗时:"+(end-first)+"ms"); } } 一个非常规的排序算法。只是实际运行起来效率确实不怎么好。主要是看运气了。10个数的排序竟然有时候能给我循环一千多W次。我擦。