[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fzi_cJjXi3qZ_kCtb04k40xnlT7-WgU8_ibSoYvJ5wHc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":29,"type":30},[],"2023-05-10 05:16:03",2397336,[8,9,10,11],"简单选择排序","直接插入排序","希尔排序","快速排序",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000007853","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2a47b2873f4346e98f41a1c4789e76fd.png","数据结构（山东联盟-山东航空学院）","1449674","第八章单元测试","(15,9,7,8,20,-1,4)进行排序,第一趟排序后的序列变为(-1,9,7,8,20,15,4),则采用的排序方法是( )",[20,31,37,44,53,61,70,79,84,90],{"answer":21,"createTime":5,"id":22,"options":23,"question":28,"source":29,"type":30},[],2232394,[24,25,26,27],"O(1)","O(logn)","O(n2)","O(n)","如果对n个元素进行直接选择排序,则进行任一趟排序的进程中,为寻找最小值元素所需要的时间复杂度为()","v2",0,{"answer":32,"createTime":5,"id":33,"options":34,"question":36,"source":29,"type":30},[],2307313,[8,35,11,9],"冒泡排序","对一组数据{84,45,20,10,16}排序,数据的排列次序在排序过程中的变化为: (1){84,45,20,10,16} (2){10,45,20,84,16} (3){10,16,20,84,45} (4){10,16,20,45,84} 该排序算法是以下哪种()",{"answer":38,"createTime":5,"id":39,"options":40,"question":43,"source":29,"type":30},[],2310082,[35,11,41,42],"堆排序","选择排序","设有1000个无序的元素,希望用最快的速度的选出其中前10个最大的元素,最好选用()的排序法",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":29,"type":30},[],2310104,[48,49,50,51],"38,40,46,56,79,84","40,38,46,79,56,84","40,38,46,56,79,84","40,38,46,84,56,79","一组记录的关键码为(46,79,56,38,40,84),则利用快速排序的方法,以第一个记录为基准得到的一次划分结果为()",{"answer":54,"createTime":5,"id":55,"options":56,"question":59,"source":29,"type":60},[],2324182,[57,58],"对","错","希尔排序是稳定的排序算法",3,{"answer":62,"createTime":5,"id":63,"options":64,"question":69,"source":29,"type":30},[],2324202,[65,66,67,68],"1","2","3","0","希尔排序又称缩小增量排序,其最后一趟排序的增量为( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":29,"type":30},[],2324208,[74,75,76,77],"从大到小排列","从小到大排列","元素基本有序","元素无序","对m个不同的关键字由小到大进行冒泡排序,当( )时比较的次数最多",{"answer":80,"createTime":5,"id":81,"options":82,"question":83,"source":29,"type":30},[],2324210,[11,9,42,35],"从未排序序列中挑选元素,并将其依次放入已排序序列(初始时为空)的一端的方法,称为( )",{"answer":85,"createTime":5,"id":86,"options":87,"question":89,"source":29,"type":30},[],2324225,[42,10,41,88],"插入排序","从未排序序列中依次取出元素与已排序序列中的元素进行比较,将其放入已排序序列的正确位置上的排序方法称为( )",{"answer":91,"createTime":5,"id":6,"options":92,"question":18,"source":29,"type":30},[],[8,9,10,11]]