．下列四個序列中哪一個是堆( )【北京工商大學 一 (分)】
A B
C D
堆排序是( )類排序堆排序平均執行的時間復雜度和需要附加的存儲空間復雜度分別是( )【西北大學 二】
A 插入 B 交換 C 歸並 D 基數 E 選擇 F O(n)和O() G O(nlogn)和O() H O(nlogn)和O(n) I O(n)和O(n)
．在對n個元素的序列進行排序時堆排序所需要的附加存儲空間是( )【西安電子科技大學應用一(分)】
A O(logn) B O() C O(n) D O(nlogn)
． 對n 個記錄的文件進行堆排序最壞情況下的執行時間是多少？( )【北方交通大學 一(分)】
A．O(logn)B．O(n) C．O(nlogn) D．O(n*n)
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/22984.html
