[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fyfUBb8HPQPVRTxmugMdsbLbIQIZor6OTq_dLfWuGHFE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":17,"related":18,"source":29,"type":104},[],"2023-06-10 19:47:34",57298237,[8,9],"正确","错误",{"count":11,"courseId":12,"courseImg":13,"courseName":14,"workId":15,"workName":16},23,"02f895242138348229452b9cbe8bbf08","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F59d71c300dff6ba7fa49e1ad37a4ae2d.jpg","算法设计与分析","work_28155388","第一章练习题","10=&theta;(log10)",[19,31,40,49,57,66,75,81,86,95],{"answer":20,"createTime":21,"id":22,"options":23,"question":28,"source":29,"type":30},[],"2023-06-10 19:41:52",57290974,[24,25,26,27],"O(1)","O(n)","O(n2)","O(nlogn)","- i - 1): if arr[j] &gt; arr[j + 1]: arr[j], arr[j + 1] = arr[j + 1], arr[j] return arr 请分析算法的时间复杂度,用O表示","v1",0,{"answer":32,"createTime":21,"id":33,"options":34,"question":39,"source":29,"type":30},[],57290975,[35,36,37,38],"100元","100只鸡","各种鸡的单价","无需任何输入","百元买白鸡问题:鸡翁一,值钱五;鸡母一,值钱三;鸡雏三,值钱一;百钱买百鸡,则翁、母、雏各几何?设计一算法,则该算法的输入是()",{"answer":41,"createTime":21,"id":42,"options":43,"question":48,"source":29,"type":30},[],57290976,[44,45,46,47],"加工时间短的优先安排","加工时间长的优先安排","等待时间短的优先安排","以上都不对","调度问题的算法设计策略是()",{"answer":50,"createTime":21,"id":51,"options":52,"question":56,"source":29,"type":30},[],57290977,[53,54,55,47],"重量小的优先装","价值大的优先装","单位重量价值大的优先装","背包问题的算法设计策略是()",{"answer":58,"createTime":21,"id":59,"options":60,"question":65,"source":29,"type":30},[],57290978,[61,62,63,64],"自然语言","程序流程图","伪码","程序设计语言","输入:非负整数m,n,其中m,n不全为0 输出:m与n的最大公约数 1.while m&gt;0 do 2. r&larr;n mod m 3. n &larr;m 4. m &larr;r 5.return n",{"answer":67,"createTime":21,"id":68,"options":69,"question":74,"source":29,"type":30},[],57290979,[70,71,72,73],"n","2^n","2n","logn","汉诺塔问题的时间复杂度是()",{"answer":76,"createTime":21,"id":77,"options":78,"question":80,"source":29,"type":30},[],57290980,[70,73,79,72],"n^2","二分搜索(二分查找)算法的时间复杂度是()",{"answer":82,"createTime":21,"id":83,"options":84,"question":85,"source":29,"type":30},[],57290981,[70,70,72,79],"阶乘问题求n!算法的时间复杂度为()",{"answer":87,"createTime":21,"id":88,"options":89,"question":94,"source":29,"type":30},[],57290982,[90,91,92,93],"n!=1 当n=0时","n!=1 当n=1时","n!=1 当n〈1时","n!=1 当n〈=1时","return(1); else return(fun(n-1)*n); }",{"answer":96,"createTime":21,"id":97,"options":98,"question":103,"source":29,"type":30},[],57290983,[99,100,101,102],"Fibonacci(n)=0 当n=0时","Fibonacci(n)=1 当n=1时","Fibonacci(n)=Fibonacci(n-1)+Fibonacci(n-2) 当n〉1时","Fibonacci(n)=Fibonacci(n-2)+Fibonacci(n-3) 当n〉1时","return num; return Fibonacci(num-1)+Fibonacci(num - 2)}",3]