[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f0m732dxngA8lNhLAdVfruD0aBtFkiV-ZAnmSTBloriY":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-07-05 11:47:14",157496891,[8,9,10,11],"38, 40, 46, 56, 79, 84","40, 38, 46, 79, 56, 84","40, 38, 46, 56, 79, 84","40, 38, 46, 84, 56, 79",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},53,"dc0d4d75600414c6d1f9eb14ea0825ce","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fb2433770d0c44ab4fb70dc7c7aaa819b.png","2023数据结构-本科","work_35329965","New_Chap08_复习","若一组记录的排序码为{46,79,56,38,40,84},则利用快速排序的方法,以第一个记录为基准得到的一次划分结果为()",[21,32,37,46,55,64,73,76,85,94],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],157496873,[25,26,27,28],"归并排序","冒泡排序","插入排序","选择排序","从未排序序列中依次取出元素与已排序序列中的元素进行比较,将其放人已排序序列的正确位 置上的方法称为()","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":36,"source":30,"type":31},[],157496876,[25,26,27,28],"从未排序序列中挑选元素,并将其依次放入已排序序列(初始时为空)的一端的方法,称为( )",{"answer":38,"createTime":5,"id":39,"options":40,"question":45,"source":30,"type":31},[],157496879,[41,42,43,44],"从小到大排列好","从大到小排列好","元素无序","元素基本有序","对 n 个不同的关键字由小到大进行冒泡排序,在()的情况下比较的次数最多",{"answer":47,"createTime":5,"id":48,"options":49,"question":54,"source":30,"type":31},[],157496882,[50,51,52,53],"n+1","n","n-1","n(n-1)\u002F2","对n个不同的关键字进行冒泡排序,在元素无序的情况下比较的次数最多为( )",{"answer":56,"createTime":5,"id":57,"options":58,"question":63,"source":30,"type":31},[],157496885,[59,60,61,62],"被排序的数据中含有多个相同排序码","被排序的数据已基本有序","被排序的数据完全无序","被排序的数据中的最大值和最小值相差悬殊","快速排序在( )的情况下最易发挥其长处",{"answer":65,"createTime":5,"id":66,"options":67,"question":72,"source":30,"type":31},[],157496888,[68,69,70,71],"O(n)","O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F757ea417ec6dcc6ff1ae4660e83c3564.png\">)","O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa236db1cfaabcfd49f661f70a8126ec3.png\">)","O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F027e91b2a61fb531741b156ba211aa9f.png\">)","对n个关键字作快速排序,在最坏情况下,算法的时间复杂度是( )",{"answer":74,"createTime":5,"id":6,"options":75,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":77,"createTime":5,"id":78,"options":79,"question":84,"source":30,"type":31},[],157496894,[80,81,82,83],"16, 72, 31, 23, 94, 53","94, 23, 31, 72, 16, 53","16, 53, 23, 94, 31, 72","16, 23, 53, 31, 94, 72","下列关键字序列中, ( )是堆",{"answer":86,"createTime":5,"id":87,"options":88,"question":93,"source":30,"type":31},[],157496897,[89,90,91,92],"插人","选择","交换","归并","堆是一种( )排序",{"answer":95,"createTime":5,"id":96,"options":97,"question":102,"source":30,"type":31},[],157496900,[98,99,100,101],"二叉排序树","满二叉树","完全二叉树","平衡二叉树","堆的形状是一棵( )"]