量子猴排（Quantum Bogo sort）

排序原理

原理很简单，如果数组不是有序的，就洗一次牌，直至数组有序为止

时间复杂度

最佳情况O(n)，平均情况O(n×n!)

代码如下：

 import java.util.Random;

 public class QuantumBogo {
     private static Random random = new Random();

     public static void sort(Comparable[] a){
 //        int count = 0;
         while (!isOrder(a)) {
             shuffle(a);
 //            count++;
         }
     }

     private static boolean isOrder(Comparable[] a){
         for (int i = 1; i < a.length; i++) {
             if (a[i-1].compareTo(a[i]) > 0)
                 return false;
         }
         return true;
     }

     private static void shuffle(Comparable[] a){
         int n = a.length;
         for (int i = 0; i < n; i++) {
             int r = i + random.nextInt(n-i);
             Comparable temp = a[i];
             a[i] = a[r];
             a[r] = temp;
         }
     }

     private static void show(Comparable[] a){
         for (int i = 0; i < a.length; i++)
             System.out.print(a[i] + " ");
         System.out.println();
     }

     public static void main(String[] args){
         Integer[] a = new Integer[12];
         for (int i = 0; i < 12; i++) {
             a[i] = random.nextInt(65536);
         }
         show(a);
         sort(a);
         show(a);
     }
 }