[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fCD9RhsuhyWPI-aEGx29xXbjV-L2S5ek85jywjrwl8aA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2025-06-10 11:01:12",197528431,[8,9,10,11],"O(n)","O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7480fe73b37a9ad0890e4fc5e7bfd381.png\">)","O(logn)","O(nlogn)",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},7,"f4c2bb378031389ef44eaf8c5a64d78d","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F530655c8ef07a491c6d93c29109d2c7b.jpg","数据结构与算法","work_44121008","第十四次作业","快速排序的平均时间复杂度为( )",[21,33,40,46,53,58,67],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2025-06-10 11:01:11",197528425,[26,27,28,29],"冒泡排序","简单选择排序","希尔排序","快速排序","在下述排序算法中,( )是稳定的排序算法","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":39,"source":31,"type":32},[],197528426,[37,27,28,38],"直接插入排序","折半插入排序","在完成第一趟排序后,至少能保证一个记录在最终位置上",{"answer":41,"createTime":23,"id":42,"options":43,"question":45,"source":31,"type":32},[],197528427,[37,27,29,44],"二路归并排序","用某种排序方法对数据序列(24, 88, 21, 48, 15, 27, 69, 35, 20)进行递增排序,元素序列的变化情况如下: ① (24, 88, 21, 48, 15, 27, 69, 35, 20) ② (20, 15, 21, 24, 48, 27, 69, 35, 88) ③ (15, 20, 21, 24, 35, 27, 48, 69, 88) ④ (15, 20, 21, 24, 27, 35, 48, 69, 88) 则所采用的排序方法是( )",{"answer":47,"createTime":23,"id":48,"options":49,"question":52,"source":31,"type":32},[],197528428,[28,29,50,51],"归并排序","堆排序","下列排序方法中,稳定的排序算法是( )",{"answer":54,"createTime":23,"id":55,"options":56,"question":57,"source":31,"type":32},[],197528429,[28,50,51,26],"下列排序方法中,辅助空间为O(n)的是( )",{"answer":59,"createTime":23,"id":60,"options":61,"question":66,"source":31,"type":32},[],197528430,[62,63,64,65],"排序的数据量太大","排序的数据中含有多个相同值","排序的数据个数为奇数","排序的数据已基本有序","快速排序在( )情况下最不利于发挥其长处",{"answer":68,"createTime":5,"id":6,"options":69,"question":19,"source":31,"type":32},[],[8,9,10,11]]