若用冒泡排序方法對序列{}從大到小排序需進行( )次比較【南京理工大學 一(分)】
A B C D
類似本題的另外敘述有
()若用冒泡排序對關鍵字序列{}進行從小到大的排序所需進行的關鍵字比較總次數是( )【北京工商大學 一(分)】
A B C D
采用簡單選擇排序比較次數與移動次數分別為( )【南京理工大學 一(分)】
A O(n)O(logn) B O(logn)(n*n) C (n*n)(n) D (nlogn)(n)
對序列{} 用希爾排序方法排序經一趟後序列變為{l}則該次采用的增量是( )【南京理工大學 一(分)】
A l B C D
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23005.html
