．這是一個遞歸調用問題運行結果為DBHEAIFJCKGL
（）FOR循環中每次執行PerfectShuffle(AN)和CompareExchange(AN)的結果
第次A[]=[]
A[]=[]
第次A[]=[]
A[]=[]
第次A[]=[]
A[]=[]
（）Demo的功能是將數組A中元素按遞增順序排序
（）PerfectShuffle 中WHILE循環內是賦值語句共N次WHILE外成組賦值語句相當N個簡單賦值語句CompareExchange中WHILE循環內是交換語句最好情況下不發生交換最差情況下發生N次交換相當於N個賦值語句Demo中FOR循環循環次數logN故按賦值語句次數計算Demo的時間復雜度為最好情況O(N*logN)≈O(Nlog(*N))最差情況O((N+N)*logN)≈O(Nlog(*N))
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23052.html
