[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fx5shz-YXZkeh-e9p458i0-PPbtum2SPlIKCthPgCZQ8":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-12-11 15:54:44",260132492,[8,9,10,11],"5","4","8","3",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},114,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","exam_167478617","07-排序","对数据序列 (8,9,10,4,5,6,20,1,2) 进行递增排序,采用从右往左冒泡(每趟冒出一个最小元素),需要进行的至少( )趟排序使数据递增有序",[21,32,41,50,59,68,77,86,95,104],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],260132483,[25,26,27,28],"(56,22,43,30,17,37,37,28),(17,30,22,28,56,37,37,43)","(56,43,37,30,17,37,22,28),(17,28,22,30,56,37,37,43)","(56,43,30,37,17,37,22,28),(17,43,22,30,28,37,37,56)","(56,43,37,28,17,37,22,30),(17,30,28,22,56,37,37,43)","下列集合( )是一个大根堆;( )是一个小根堆","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],260132484,[36,37,38,39],"直接插入排序,快速排序","堆排序,二路归并排序","快速排序,冒泡排序","简单选择排序,直接插入排序","下列排序算法中,平均时间复杂度最低的是( );平均时间复杂度最高的是( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],260132485,[45,46,47,48],"冒泡排序和快速排序","简单选择排序和冒泡排序","直接插入排序和简单选择排序","直接插入排序和快速排序","采用排序算法对 n 个元素进行排序,其排序趟数总是 n-1 趟的排序方法是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],260132486,[54,55,56,57],"递归次数与初始数据的排列次序有关","每次划分后,先处理较短的分区可以减少递归次数","递归次数与初始数据的排列次序无关","每次划分后,先处理较长的分区可以减少递归次数","采用递归方式对顺序表进行快速排序,下列关于递归次数的叙述中,正确的是( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],260132487,[63,64,65,66],"直接插入排序,O (1)","二路归并排序,O (n)","冒泡排序,O (n)","希尔排序,O (1)","内排序方法中,每趟将相邻两个有序区进行合并排序的方法称为( );其辅助空间为( )",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":30,"type":31},[],260132488,[72,73,74,75],"简单选择排序,希尔排序","冒泡排序,快速排序","归并排序,归并排序","堆排序,堆排序","下列排序方法中,( )在一趟结束后不一定能选出一个元素放在其最终位置上;( )是稳定的排序算法",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":30,"type":31},[],260132489,[81,82,83,84],"(1,2,5,18,20,34,12,32,6,16)","(2,18,20,34,12,32,6,16,1,5)","(2,18,20,34,6,12,16,32,1,5)","(2,6,12,16,18,20,32,34,1,5)","数据序列 (18,2,20,34,12,32,6,16,1,5) 第三趟归并排序的结果为( )",{"answer":87,"createTime":5,"id":88,"options":89,"question":94,"source":30,"type":31},[],260132490,[90,91,92,93],"(100,85,40,77,80,60,66,98,82,10,20)","(10,20,40,60,66,77,80,82,85,98)","(100,98,85,82,80,77,66,60,40,20)","(100,85,98,77,80,60,82,40,20,10,66)","以下序列不是堆的是( )",{"answer":96,"createTime":5,"id":97,"options":98,"question":103,"source":30,"type":31},[],260132491,[99,100,101,102],"快速排序,堆排序","简单选择排序,快速排序","直接插入排序,直接插入排序","归并排序,简单选择排序","若表 R 的初始数据接近正序排列,则( )方法的比较次数最少;已知表 R 中的每个元素距其最终位置不远,采用( )方法最节省时间",{"answer":105,"createTime":5,"id":6,"options":106,"question":19,"source":30,"type":31},[],[8,9,10,11]]