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