[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fbxq21notXT3gtH1ZJNP5eXKOP1dbpKecvmL4pOeITDM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-12-23 23:35:07",120407525,[8,9,10,11],"直接插入排序","快速排序","直接选择排序","堆排序",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},53,"794f1a6d84d0aa0b0a4a74271d0c7b83","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F088f5a044ac5a92ee2ca71a5a7f12110.png","数据结构（混合教学）","work_31818048","模块七客观题","下列排序算法中,在每一趟都能选出一个元素放到其最终位置上,并且其时间性能受数据初始特性影响的是( )",[21,32,35,44,50,59,68,77,85,94],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],120407524,[25,26,27,28],"(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),则利用快速排序的方法,以第一个记录为基准得到的一次划分结果为( )","v1",0,{"answer":33,"createTime":5,"id":6,"options":34,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":30,"type":31},[],120407527,[39,40,41,42],"O(log2n)","O(n)","O(nlog2n)","O(n2)","直接插入排序在最好情况下的时间复杂度为( )",{"answer":45,"createTime":5,"id":46,"options":47,"question":49,"source":30,"type":31},[],120407528,[9,11,48,8],"归并排序","若需在O(nlog2n)的时间内完成对数组的排序,且要求排序是稳定的,则可选择的排序方法是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],120407530,[54,55,56,57],"75,65,30,15,25,45,20,10","75,65,45,10,30,25,20,15","75,45,65,30,15,25,20,10","75,45,65,10,25,30,20,15","下列四个序列中,哪一个是堆( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],120407531,[63,64,65,66],"冒泡","希尔插入","交换","快速","就平均性能而言,目前最好的内排序方法是( )排序法",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":30,"type":31},[],120407532,[72,73,74,75],"要排序的数据量太大","要排序的数据中含有多个相同值","要排序的数据个数为奇数","要排序的数据已基本有序","快速排序方法在( )情况下最不利于发挥其长处",{"answer":78,"createTime":5,"id":79,"options":80,"question":84,"source":30,"type":31},[],120407534,[81,63,82,83],"选择","插入","堆","在排序算法中,每次从未排序的记录中挑出最小(或最大)关键码字的记录,加入到已排序记录的末尾,该排序方法是( )",{"answer":86,"createTime":5,"id":87,"options":88,"question":93,"source":30,"type":31},[],120407535,[89,90,91,92],"直接插入","直接选择","希尔","二路归并","从未排序序列中依次取出一个元素与已排序序列中的元素依次进行比较,然后将其放在已排序序列的合适位置,该排序方法称为( )排序法",{"answer":95,"createTime":96,"id":97,"options":98,"question":103,"source":30,"type":31},[],"2023-12-23 23:35:08",120407538,[99,100,101,102],"该排序算法不允许有相同的关键字记录","该排序算法允许有相同的关键字记录","平均时间为O(nlog2n)的排序方法","以上都不对","某内排序方法的稳定性是指( )"]