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