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