[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f-3te5KFiEZwvF8hru0VRuwLUrkTKHrtr-oUlgLno0tQ":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-05-10 20:19:17",4634845,[8,9,10,11],"O(n)","O(n2)","O(nlog2n)","O(log2n)",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},7,"daaa4536ddd2d86662e01f99af96e9ff","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcd90e4dea3c8fcd517490db61d41ec25.png","数据结构","71e215d9dd5c42089da8066ecb8bd96c","算法与时间复杂度","以下算法的时间复杂度为( ).void fun (int n ) {int i=1 ;while (i<=n )i=i*2}",[21,32,41,44,49,54,60],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],4634843,[25,26,27,28],"程序","问题求解步骤的描述","要满足五个基本特性","A 和C","一个算法应该是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],4634844,[36,37,38,39],"问题规模是n2","执行时间等于n2","执行时间与n2 成正比","问题规模与n2 成正比","某算法的时间复杂度为O(n2) ,表明该算法的()",{"answer":42,"createTime":5,"id":6,"options":43,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":45,"createTime":5,"id":46,"options":47,"question":48,"source":30,"type":31},[],4634846,[11,8,10,9],"【2011 统考真题】设n 是描述问题规模的非负整数,下面的程序片段的时间复杂度是().x=2 :while (x<n\u002F2 )x=2*x",{"answer":50,"createTime":5,"id":51,"options":52,"question":53,"source":30,"type":31},[],4634847,[11,8,10,9],"【2012 统考真题】求整数n ( n>=0 )的阶来的算法如下, 其时间复杂度是( ).int fact (int n ) {if(n<=1) return1 ;return n*fact (n-1)",{"answer":55,"createTime":56,"id":57,"options":58,"question":59,"source":30,"type":31},[],"2024-12-12 12:19:21",170620929,[11,8,10,9],"设n 是描述问题规模的非负整数,下面的程序片段的时间复杂度是().x=2 :while (x<n\u002F2 )x=2*x",{"answer":61,"createTime":62,"id":63,"options":64,"question":65,"source":30,"type":31},[],"2024-12-12 12:19:23",170620931,[11,8,10,9],"求整数n ( n>=0 )的阶来的算法如下, 其时间复杂度是( ).int fact (int n ) {if(n<=1) return1 ;return n*fact (n-1)"]