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