数据结构考研分类复习真题 第十章 答案[25]

()当至多进行n趟起泡排序或一趟起泡排序中未发生交换(即已有序)时结束排序

()希尔排序是对直接插入排序算法的改进它从记录个数少和基本有序出发将待排序的记录划分成几组(缩小增量分组)从而减少参与直接插入排序的数据量当经过几次分组排序后记录的排列已经基本有序这个时候再对所有的记录实施直接插入排序

()

()采用树型锦标赛排序选出最小关键字至少要次比较再选出次小关键字比较次(两两比较次选出个优胜再两两比较次选出个优胜半决赛两场决赛一场共比较了次将冠军的叶子结点改为最大值均与兄弟比较共次选出亚军)

类似叙述() 略

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