[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fefj8qmkjNxftp7hVGqNkJBLOAJ7qHBKzgPhscAOybjw":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-12-27 06:52:07",174393984,[8,9,10,11],"仅I、II","仅III、IV","仅I、II、IV","II、III、IV",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},12,"8a9c85f92f4d64871781b07b7c130db6","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8c07f95346bcd12517268edb813c02cb.png","数据结构","work_40001464","排序(接上次作业)","对数据进行排序时,若采用直接插入排序而不采用快速排序,则可能的原因是( ). I. 大部分元素已有序 II. 待排序元素数量很少 III. 要求空间复杂度为 𝑂(1) IV. 要求排序算法是稳定的",[21,32,41,50,59,62,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],174393980,[25,26,27,28],"9, 8, 7 ,6, 5, 4, 1","9, 8, 7, 5, 6, 1, 4","9, 8, 7, 5, 6, 4, 1","9, 6, 7, 5, 8, 4, 1","将关键字6, 9, 1, 5, 8, 4, 7依次插入到初始为空的大根堆H中,得到的H是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],174393981,[36,37,38,39],"3, 5, 12, 8, 28, 20, 15, 22, 19","3, 5, 12, 19, 20, 15, 22, 8, 28","3, 8, 12, 5, 20, 15, 22, 28, 19","3, 12, 5, 8, 28, 20, 15, 22, 19","已知关键字序列5, 8, 12, 19, 28, 20, 15, 22是小根堆(最小堆),插入关键字3,调整后得到的小根堆是( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],174393982,[45,46,47,48],"11","70","80","81","使用快速排序算法对数据进行升序排序, 若经过一次划分后得到的数据序列是 68, 11, 70, 23, 80, 77, 48, 81, 93, 88,则该次划分的轴枢是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],174393983,[54,55,56,57],"仅 I 和 II","仅 II 和 V","仅 I、III 和 IV","仅 III 、 IV 和 V","下列排序算法中,不稳定的是( ). I. 希尔排序 II. 归并排序 III. 快速排序 IV. 堆排序 V. 基数排序",{"answer":60,"createTime":5,"id":6,"options":61,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],174393985,[66,67,68,69],"将两个有序表合并为一个新的有序表","将 𝑀 划分为两部分,两部分的元素个数大致相等","将 𝑀 分成 𝑛 个部分,每个部分中仅含有一个元素","将 𝑀 划分为两部分,一部分元素的值均小于另一部分元素值","使用二路归并排序对含 𝑛 个元素的数组 𝑀 进行排序时,二路归并排序操作的功能是( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],174393986,[75,76,77,78],"43, 892","236, 301","301, 892","485, 301","设数组 S[] = {93, 946, 372, 9, 146, 151, 301, 485, 236, 327, 43, 892},采用最低位优先(LSD)基数排序将S排列成升序序列.第1趟分配、收集后,元素372之前、之后紧邻的元素分别是( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],174393987,[84,85,86,87],"冒泡排序","选择排序","插入排序","归并排序","若数据元素序列{ 11,12,13,7,8,9,23,4,5 }是采用下列排序方法之一得到的第二趟排序后的结果,则该排序算法只能是",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],174393988,[93,94,95,96],"起泡排序","快速排序","堆排序","基数排序","设有1000个无序的元素,希望用最快的速度挑选出其中前10个最大的元素,最好( )排序法",{"answer":99,"createTime":5,"id":100,"options":101,"question":103,"source":30,"type":31},[],174393989,[102,95,87,94],"希尔排序","请选择下面四种排序算法中最快又是稳定的排序算法"]