()當至多進行n趟起泡排序或一趟起泡排序中未發生交換(即已有序)時結束排序
()希爾排序是對直接插入排序算法的改進它從記錄個數少和基本有序出發將待排序的記錄劃分成幾組(縮小增量分組)從而減少參與直接插入排序的數據量當經過幾次分組排序後記錄的排列已經基本有序這個時候再對所有的記錄實施直接插入排序
()
()采用樹型錦標賽排序選出最小關鍵字至少要次比較再選出次小關鍵字比較次(兩兩比較次選出個優勝再兩兩比較次選出個優勝半決賽兩場決賽一場共比較了次將冠軍的葉子結點改為最大值均與兄弟比較共次選出亞軍)
類似敘述() 略
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23187.html
