[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f3ui02hoc2e1Nvyh4ZNeCy3c2rbfQw3a99-wKgAeiOhg":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":24,"origin":103,"createTime":95},178632970,"v1","求n!问题,表示算法的复杂性的递归函数下述正确的是",[8,9,10,11],"T(n)=O(1),当n=1T(n)=T(n-1)+O(1),当n>1","T(n)=O(1),当n=1T(n)=nT(n-1)+O(1),当n>1","T(n)=O(1),当n=1T(n)=2T(n\u002F2)+O(1),当n>1","T(n)=O(1),当n=1T(n)=T(n\u002F2)+O(n),当n>1",[],[14,27,34,40,50,60,67,77,87,96],{"id":15,"source":5,"question":16,"options":17,"answer":22,"related":23,"type":24,"origin":25,"createTime":26},178632947,"算法分析中,记号O表示( )",[18,19,20,21],"渐近下界","渐近上界","渐近紧确界","紧渐进界",[],[],0,null,"2025-03-08T18:42:03+08:00",{"id":28,"source":5,"question":29,"options":30,"answer":32,"related":33,"type":24,"origin":25,"createTime":26},178632948,"算法分析中,记号Θ表示( )",[19,18,20,31],"渐近紧界",[],[],{"id":35,"source":5,"question":36,"options":37,"answer":38,"related":39,"type":24,"origin":25,"createTime":26},178632949,"算法分析中,记号Ω表示( )",[19,18,20,31],[],[],{"id":41,"source":5,"question":42,"options":43,"answer":48,"related":49,"type":24,"origin":25,"createTime":26},178632950,"记号O的定义正确的是( )",[44,45,46,47],"O(g(n)) = { f(n) | 存在正常数c和n0使得对所有n≥n0有:0≤f(n)≤cg(n) }","O(g(n)) = { f(n) | 存在正常数c和n0使得对所有n≥n0有:0≤cg(n)≤f(n) }","O(g(n)) = { f(n) | 对于任何正常数c>0,存在正数和n0>0使得对所有n≥n0有:0≤f(n)\u003Ccg(n) }","O(g(n)) = { f(n) | 对于任何正常数c>0,存在正数和n0>0使得对所有n≥n0有:0≤cg(n) \u003C f(n) }",[],[],{"id":51,"source":5,"question":52,"options":53,"answer":58,"related":59,"type":24,"origin":25,"createTime":26},178632951,"函数T(n)=5n3+100n2+2用Ο记号可表示为( )",[54,55,56,57],"Ο(1)","Ο(n3)","Ο(n2)","Ο(n)",[],[],{"id":61,"source":5,"question":62,"options":63,"answer":65,"related":66,"type":24,"origin":25,"createTime":26},178632952,"函数T(n)=2n2+3n+1用Ο记号可表示为( )",[54,55,57,64],"Ο(nlogn)",[],[],{"id":68,"source":5,"question":69,"options":70,"answer":75,"related":76,"type":24,"origin":25,"createTime":26},178632953,"有时间复杂性n,n2,nlogn,n!,2n,时间复杂性从低到高的顺序是",[71,72,73,74],"n,nlogn,n2,n!,2n","n,n2,nlogn,n!,2n","n,nlogn,n2,2n,n","n,n2,nlogn,2n,n",[],[],{"id":78,"source":5,"question":79,"options":80,"answer":85,"related":86,"type":24,"origin":25,"createTime":26},178632954,"函数T(n)=2n3+100n2+1000n+10!,用O记号可以表示为",[81,82,83,84],"O(n3)","O(n2)","O(10!)","O(n)",[],[],{"id":88,"source":5,"question":89,"options":90,"answer":93,"related":94,"type":24,"origin":25,"createTime":95},178632955,"函数T(n)=100n2+1000nlogn+1,用O记号可以表示为",[84,82,91,92],"O(nlogn)","O(1000)",[],[],"2025-03-08T18:42:04+08:00",{"id":97,"source":5,"question":98,"options":99,"answer":101,"related":102,"type":24,"origin":25,"createTime":95},178632956,"下述程序段的时间复杂度为( ).for(i=0; i\u003Cn-1; i++) for(j=0; j\u003Cn-1-i; j++) t=a[j]; a[j]=a[j+1]; a[j+1]=t",[100,84,82,81],"O(1)",[],[],{"courseName":104,"courseImg":105,"workName":106,"workId":107,"count":108,"courseId":109},"算法设计与分析","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F92d5d68df708b116676ce216628329bf.jpg","1,算法的复杂度分析(20-25.33.34.39)","work_41070505",29,"2c2aaddf20e0f771b69adb03016fc624"]