[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f-gcZ-6TUPLUJedMLl8QXMAir0W2w2g48h-zaRNeT3X4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-06-10 19:41:52",57290980,[8,9,10,11],"n","logn","n^2","2n",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},23,"02f895242138348229452b9cbe8bbf08","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F59d71c300dff6ba7fa49e1ad37a4ae2d.jpg","算法设计与分析","work_28155388","第一章练习题","二分搜索(二分查找)算法的时间复杂度是()",[21,32,41,50,58,67,73,76,81,90],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],57290974,[25,26,27,28],"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":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],57290975,[36,37,38,39],"100元","100只鸡","各种鸡的单价","无需任何输入","百元买白鸡问题:鸡翁一,值钱五;鸡母一,值钱三;鸡雏三,值钱一;百钱买百鸡,则翁、母、雏各几何?设计一算法,则该算法的输入是()",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],57290976,[45,46,47,48],"加工时间短的优先安排","加工时间长的优先安排","等待时间短的优先安排","以上都不对","调度问题的算法设计策略是()",{"answer":51,"createTime":5,"id":52,"options":53,"question":57,"source":30,"type":31},[],57290977,[54,55,56,48],"重量小的优先装","价值大的优先装","单位重量价值大的优先装","背包问题的算法设计策略是()",{"answer":59,"createTime":5,"id":60,"options":61,"question":66,"source":30,"type":31},[],57290978,[62,63,64,65],"自然语言","程序流程图","伪码","程序设计语言","输入:非负整数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":68,"createTime":5,"id":69,"options":70,"question":72,"source":30,"type":31},[],57290979,[8,71,11,9],"2^n","汉诺塔问题的时间复杂度是()",{"answer":74,"createTime":5,"id":6,"options":75,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":77,"createTime":5,"id":78,"options":79,"question":80,"source":30,"type":31},[],57290981,[8,8,11,10],"阶乘问题求n!算法的时间复杂度为()",{"answer":82,"createTime":5,"id":83,"options":84,"question":89,"source":30,"type":31},[],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":30,"type":31},[],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)}"]