[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f3dyadxbIzvDann9Ar2aw0ZsmzSs2UCcGX9Qu6ZS5li0":3},{"id":4,"source":5,"question":6,"options":7,"answer":13,"related":14,"type":25,"origin":113,"createTime":27},122235637,"v1","堆排序是( )类排序",[8,9,10,11,12],"交换","基数","选择","插入","归并",[],[15,28,32,42,52,62,72,82,93,103],{"id":16,"source":5,"question":17,"options":18,"answer":23,"related":24,"type":25,"origin":26,"createTime":27},122235634,"一个算法应该是( )",[19,20,21,22],"A和C","问题求解步骤的描述","程序","要满足五个基本特性",[],[],0,null,"2023-12-26T20:01:42+08:00",{"id":4,"source":5,"question":6,"options":29,"answer":30,"related":31,"type":25,"origin":26,"createTime":27},[8,9,10,11,12],[],[],{"id":33,"source":5,"question":34,"options":35,"answer":40,"related":41,"type":25,"origin":26,"createTime":27},122235639,"对于(n,m)阶图G来说,BFS算法的时间复杂度为( )",[36,37,38,39],"O(n+m)","O(n m)","O(nm)","O(mn)",[],[],{"id":43,"source":5,"question":44,"options":45,"answer":50,"related":51,"type":25,"origin":26,"createTime":27},122235647,"实现循环赛日程表利用的算法是( )",[46,47,48,49],"贪心算法","分治算法","回溯法","动态规划法",[],[],{"id":53,"source":5,"question":54,"options":55,"answer":60,"related":61,"type":25,"origin":26,"createTime":27},122235651,"在一棵三元树中度为 3 的结点数为 2 个,度为 2 的结点数为 1 个,度为 1 的结点数为 2 个,则度为 0 的结点数为( )个",[56,57,58,59],"6","5","7","4",[],[],{"id":63,"source":5,"question":64,"options":65,"answer":70,"related":71,"type":25,"origin":26,"createTime":27},122235658,"以下关于渐进记号的性质是正确的是:( )",[66,67,68,69],"f(n) = O(g(n)) ⇔ g(n) = O(f(n))","f(n) =Θ(g(n)),g(n) =Θ(h(n)) ⇒ f(n) =Θ(h(n))","O(f(n))+O(g(n)) = O(min{f(n),g(n)})","f(n) =O(g(n)),g(n) =O(h(n)) ⇒ h(n) =O(f(n))",[],[],{"id":73,"source":5,"question":74,"options":75,"answer":80,"related":81,"type":25,"origin":26,"createTime":27},122235665,"一棵左右子树均不空的二叉树在先序线索化后,其中空的链域的个数是:()",[76,77,78,79],"1","2","不确定","0",[],[],{"id":83,"source":5,"question":84,"options":85,"answer":90,"related":91,"type":25,"origin":26,"createTime":92},122235668,"下列四个序列中,哪一个是堆( )",[86,87,88,89],"75,65,30,15,25,45,20,10","75,45,65,10,25,30,20,15","75,45,65,30,15,25,20,10","75,65,45,10,30,25,20,15",[],[],"2023-12-26T20:01:43+08:00",{"id":94,"source":5,"question":95,"options":96,"answer":101,"related":102,"type":25,"origin":26,"createTime":92},122235673,"设森林 F 对应的二叉树为 B,它有 m 个结点,B 的根为 p,p 的右子树结点个数为 n,森林 F 中第一棵树的 结点个数是( )",[97,98,99,100],"m-n-1","n+1","条件不足,无法确定","m-n",[],[],{"id":104,"source":5,"question":105,"options":106,"answer":111,"related":112,"type":25,"origin":26,"createTime":92},122235678,"赫夫曼编码的贪心算法所需的计算时间为 ( )",[107,108,109,110],"\u003Cimg src=\"\u002Fananas\u002Flatex\u002Fp\u002F508207\">","O(n)","\u003Cimg src=\"\u002Fananas\u002Flatex\u002Fp\u002F4795156\">","O(nlgn)",[],[],{"courseName":114,"courseImg":115,"workName":116,"workId":116,"count":25,"courseId":117},"算法导论","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9b42e067d0b0784b06a988cb0707ce38.png","","c7fc408762ed256dcd0155353552972d"]