[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$ftF_Jpm5coSxzrmK1-b0d3wDs_ZUBl3UJw34LTrY-vuQ":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":29,"type":30},[],"2024-09-26 12:54:25",160257356,[8,9,10,11],"Θ(n)","Θ(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2815196056c8a054360d9b1c86374fd5.webp\">)","Θ(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff35140365daa1c7f03504cf8da491be0.webp\">)","Θ(n(n-1))",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},30,"4cb7fc80046eeb6c91b421de3a39e805","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc4c491a4bf65856aa9400a6bdf60473f.jpg","算法分析与设计","work_36747550","20.6 英文科技论文写作与投稿(六)","设S是一组n条直线,其中没有两条是平行的,也没有三条在同一点相交.可以用数学归纳法证明S中的直线确定了()个交点",[21,31,40,48,54,62,65,74,80,86],{"answer":22,"createTime":5,"id":23,"options":24,"question":28,"source":29,"type":30},[],160257350,[25,26,27],"时间复杂度下界","时间复杂度上界","时间复杂度均值","算法分析包括最好情况下的时间复杂度(时间复杂度下界)、最坏情况下的时间复杂度(时间复杂度上界)和平均情况下的时间复杂度(时间复杂度均值).实践表明可操作性最好的,且最有实际价值的,是()","v1",0,{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":29,"type":30},[],160257351,[35,36,37,38],"n","2n","4n","8n","计算T(n) T(n) = 4, 当n=1T(n) = T(n-1)+4, 其它",{"answer":41,"createTime":5,"id":42,"options":43,"question":47,"source":29,"type":30},[],160257352,[44,45,35,46],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2815196056c8a054360d9b1c86374fd5.webp\">","n(n+1)\u002F2","n(n+1)","计算T(n) T(n) = 1, n=1 T(n) = T(n-1) +n, 其它",{"answer":49,"createTime":5,"id":50,"options":51,"question":53,"source":29,"type":30},[],160257354,[45,36,52,44],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp\">","计算T(n) T(n) = 1, n=0 T(n) = 2T(n-1) , 其它",{"answer":55,"createTime":5,"id":56,"options":57,"question":61,"source":29,"type":30},[],160257355,[58,59,60],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fec0abaa66adfefec54c656e7c2a0c695.webp\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fec0abaa66adfefec54c656e7c2a0c695.webp\">-1","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp\">+1","计算T(n) T(n) = 1, n=0 T(n) = 2T(n-1) +\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp\">, 其它",{"answer":63,"createTime":5,"id":6,"options":64,"question":19,"source":29,"type":30},[],[8,9,10,11],{"answer":66,"createTime":5,"id":67,"options":68,"question":73,"source":29,"type":30},[],160257357,[69,70,71,72],"O(n)","O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2815196056c8a054360d9b1c86374fd5.webp\">)","Ο(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp\">)","O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4da8094339c9d29ef77e83022046638d.webp\">)","给出算法的时间复杂性 Loop(n): p ← 0 for i ← 0 to 2n do p ← p*i",{"answer":75,"createTime":5,"id":76,"options":77,"question":79,"source":29,"type":30},[],160257358,[69,70,72,78],"O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp\">)","给出算法的时间复杂性 Loop(n): p ← 0 for i ← 0 to \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2815196056c8a054360d9b1c86374fd5.webp\"> do p ← p*i",{"answer":81,"createTime":5,"id":82,"options":83,"question":85,"source":29,"type":30},[],160257359,[69,70,84,72],"O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff35140365daa1c7f03504cf8da491be0.webp\">)","给出算法的时间复杂性 Loop(n): s ← 0 for i ← 0 to \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcdfe18a787f54dd9692e470c42a1a949.webp\"> do for j← 1 to i do s ← s+i",{"answer":87,"createTime":5,"id":88,"options":89,"question":94,"source":29,"type":30},[],160257360,[90,91,92,93],"O(logn)","O(log3\u002F2n)","O(log2\u002F3n)","O(log(2\u002F3)n)","T(n)=T(n\u002F3)+T(2n\u002F3)+n"]