数据结构考研分类复习真题 第十章 排序[11]

若用冒泡排序方法对序列{}从大到小排序需进行( )次比较【南京理工大学 一(分)】

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

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []