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

有一组数据()用堆排序的筛选方法建立的初始堆为( )【南京理工大学 二(分)】

A． B．

C． D．ABC均不对

归并排序中归并的趟数是( )【南京理工大学 一(分)】

A．O(n) B．O(logn) C．O(nlogn) D．O(n*n)

类似本题的另外叙述有

()归并排序的时间复杂性是( )【中山大学 一】

AO(N*N) B O(N) C O(N*LOG(N)) D O(LOG(N))

． 在排序算法中每一项都与其它各项进行比较计算出小于该项的项的个数以确定该项的位置叫( )【北京邮电大学 二 (/分)】

A．插入排序 B．枚举排序 C．选择排序 D．交换排序

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