[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fU3yp-6Rhod-7DmGOpSP38vA8c_kmCcm-UK9g2b1S_pY":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2023-05-12 09:19:48",7164819,[8,9,10,11],"94,32,40,90,80,46,21,69","32,40,21,46,69,94,90,80","21,32,46,40,80,69,90,94","90,69,80,46,21,32,94,40",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},12,"19af7db666af48b8c3d2e411f903e094","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F74b402552f1f869e5c67ec7bd99fb02f.jpg","数据结构","21b60136175a4908a160dd3e23c6d0a8","插入排序","用直接插入排序方法对下面四个序列进行排序(由小到大),元素比较次数最少的是( )",[21,26,35,44,51,58,63,68,76,81],{"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},[],7164820,[30,31,32,33],"O(logn)","O(n)","O(n*logn)","O(n2)","直接插入排序在最好情况下的时间复杂度为( )",{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":24,"type":25},[],7164821,[39,40,41,42],"1","4","3","2","对序列{15,9,7,8,20,-1,4} 用希尔排序方法排序,经一趟后序列变为{15,-l,4,8,20,9,7}则该次采用的增量是( )",{"answer":45,"createTime":5,"id":46,"options":47,"question":50,"source":24,"type":25},[],7164822,[48,30,31,49],"O(nlogn)","O(n*n)","基于比较方法的n个数据的内部排序.最坏情况下的时间复杂度能达到的最好下界是( )",{"answer":52,"createTime":53,"id":54,"options":55,"question":56,"source":24,"type":57},[],"2023-05-12 09:21:31",7165849,[],"若不考虑基数排序,则在排序过程中,主要进行的两种基本操作是关键字的_______和记录的_____",2,{"answer":59,"createTime":53,"id":60,"options":61,"question":62,"source":24,"type":57},[],7165850,[],"直接插入排序用监视哨的作用是_________",{"answer":64,"createTime":53,"id":65,"options":66,"question":67,"source":24,"type":57},[],7165851,[],"设用希尔排序对(98,36,-9,0,47,23,1,8,10,7)进行排序,给出的步长(也称增量序列)依次是4,2,1则排序需趟,写出第一趟结束后,数组中数据的排列次序为_______________,第二趟结束后数据的排列次序为_______________",{"answer":69,"createTime":53,"id":70,"options":71,"question":74,"source":24,"type":75},[],7165852,[72,73],"正确","错误","当待排序的元素很大时,为了交换元素的位置,移动元素要占用较多的时间,这是影响时间复杂度的主要因素.( )",3,{"answer":77,"createTime":53,"id":78,"options":79,"question":80,"source":24,"type":75},[],7165853,[72,73],"排序算法中的比较次数与初始元素序列的排列无关.( )",{"answer":82,"createTime":53,"id":83,"options":84,"question":85,"source":24,"type":75},[],7165854,[72,73],"在执行某个排序算法过程中,出现了排序码朝着最终排序序列位置相反方向移动,则该算法是不稳定的.( )"]