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