[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f5vbZ_efh6ijuFITEfvczifC37nntrqzeYFSBjZfSHy8":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":15,"related":16,"source":24,"type":40},[],"2024-01-08 02:37:22",979517395,[8,9,10,11],"n","n2","nlogn","2n",{"courseImg":13,"courseName":14},"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6f19c28afaa597952197adbd980d54e7.jpg","算法设计与分析","对n个物品的0-1背包问题用回溯法求解,其解空间树有个多少个叶子结点( )",[17,26,31,41,50,59,62,68,73],{"answer":18,"createTime":5,"id":19,"options":20,"question":23,"source":24,"type":25},[],979515074,[21,22],"对","错","二分搜索算法只适用于顺序存储结构. ( )","v2",3,{"answer":27,"createTime":5,"id":28,"options":29,"question":30,"source":24,"type":25},[],979515181,[21,22],"回溯法的时间复杂度一定比广度优先搜索低.( )",{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":24,"type":40},[],979515557,[35,36,37,38],"起泡排序","快速排列","归并排序","堆排序","如果只想得到1000个元素组成的序列中第5个最小元素之前的部分排序的序列,用哪种方法最快.( )",0,{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":24,"type":40},[],979515799,[45,46,47,48],"O(n)","O(n2)","O(logn)","O(2n)","利用合并排序,其辅助空间复杂性为( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":24,"type":40},[],979515864,[54,55,56,57],"[49 38] [97 65] [76 13] [27]","[38 49] [65 97] [13 76] [27]","[38 97] [49 65] [13 76] [27]","[38 76] [65 49] [13 97] [27]","利用合并排序,对数的序列[49] [38] [65] [97] [76] [13] [27],进行一次排序,结果为( )",{"answer":60,"createTime":5,"id":6,"options":61,"question":15,"source":24,"type":40},[],[8,9,10,11],{"answer":63,"createTime":5,"id":64,"options":65,"question":67,"source":24,"type":40},[],979517469,[45,46,66,48],"O(nlogn)","采用分治法解Hanoi塔问题的时间复杂度为( )",{"answer":69,"createTime":5,"id":70,"options":71,"question":72,"source":24,"type":25},[],979517567,[21,22],"问题的计算复杂性一般是随着问题规模的增加而增加的.( )",{"answer":74,"createTime":5,"id":75,"options":76,"question":77,"source":24,"type":25},[],979517840,[21,22],"任何递归函数都应有边界条件.( )"]