[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fdTJDOU-8eCquZjfxIIf7h-c_laDtwuf0j_bMibOUkYs":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-06-05 08:18:12",46594540,[8,9,10,11],"冒泡排序","插入排序","选择排序","归并排序",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},15,"9be9b970df8ec5aebaa7166e310777fa","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3aaed95b668c8e9929bb578413f20bb0.png","数据结构","work_28059435","第8章 排序 章节测验","若数据元素序列{11,12,13,7,8,9,23,4,5}是采用下列排序方法之一得到的第二趟排序后的结果,则该排序算法只能是( )",[21,32,40,49,55,62,68,73,76,85],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],46594533,[25,26,27,28],"排序的总趟数","元素的移动次数","使用辅助空间的数量","元素之间的比较次数","对同一待排序序列分别进行折半插入排序和直接插入排序,两者之间可能的不同之处是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":39,"source":30,"type":31},[],46594534,[8,36,37,38],"直接插入排序","希尔排序","二路归并排序","以下排序方法中,不稳定的排序方法是( )",{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":30,"type":31},[],46594535,[44,45,46,47],"3","4","6","8","对整数序列(8,9,10,4,5,6,20,1,2)进行递增排序,采用每趟冒出一个最小元素的冒泡排序算法,需要进行的趟数是( )",{"answer":50,"createTime":5,"id":51,"options":52,"question":54,"source":30,"type":31},[],46594536,[8,37,38,53],"基数排序","对一组数据(2,12,16,88,5,10)进行排序,若前三趟的结果如下: 第一趟:2,12,16,5,10,88 第二趟:2,12,5,10,16,88 第三趟:2,5,10,12,16,88 则采用的排序方法可能是( )",{"answer":56,"createTime":5,"id":57,"options":58,"question":61,"source":30,"type":31},[],46594537,[36,8,59,60],"简单选择排序","都一样","在一般情况下,以下排序算法中元素移动次数最少的( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":67,"source":30,"type":31},[],46594538,[59,8,36,66],"堆排序","数据序列(8,9,10,4,5,6,20,1,2)只能是( )算法的两趟排序后的结果",{"answer":69,"createTime":5,"id":70,"options":71,"question":72,"source":30,"type":31},[],46594539,[11,8,9,10],"从未排序序列中依次取出元素与已排序序列中的元素进行比较,将其放入已排序序列的正确位置上的方法称为( )",{"answer":74,"createTime":5,"id":6,"options":75,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":77,"createTime":5,"id":78,"options":79,"question":84,"source":30,"type":31},[],46594541,[80,81,82,83],"顺序存储","散列存储","链式存储","索引存储","为实现快速排序算法,待排序序列宜采用的存储方式是( )",{"answer":86,"createTime":5,"id":87,"options":88,"question":92,"source":30,"type":31},[],46594542,[89,44,90,91],"1","1,2","1,2,3","对大部分元素已有序的数组进行排序时,使用直接插入排序比简单选择排序更好,其原因是( ). 直接插入排序过程中元素之间的比较次数更少 直接插入排序过程中所需要的辅助空间更少 直接插入排序过程中元素的移动次数更少"]