[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fcSQuGF3cPRV7JmGTXTYTMIdS0A0IR07rUO6Pq64JPiE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-10-27 21:00:48",225003248,[8,9,10,11],"n(n+1)(2n+1)\u002F2","n(n+1)(n+1)\u002F2","n(n+1)(2n+1)\u002F6","n(n+1)(n+2)\u002F6",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},41,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_45409200","课后作业:数据结构和算法复杂度","以下程序段中语句"x++"的语句频度为() for(i=1;i<=n;i++) for(j=1;j<=i;j++) for(k=1;k<=j;k++) x++",[21,32,41,50,59,68,77,86,93,100],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],225003239,[25,26,27,28],"动态结构和静态结构","紧凑结构和非紧凑结构","线性结构和非线性结构","内部结构和外部结构","在数据结构中,从逻辑上可以把数据结构分为( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],225003240,[36,37,38,39],"存储结构","存储实现","逻辑结构","运算实现","与数据元素本身的形式、内容、相对位置、个数无关是数据的( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],225003241,[45,46,47,48],"数据具有同一特点","不仅数据元素所包含的数据项的个数要相同,而且对应的数据项的类型要一致","每个数据元素都一样","数据元素所包含的数据项的个数要相等","通常要求同一逻辑结构中的所有数据元素具有相同的特性,这意味着( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],225003242,[54,55,56,57],"数据元素是数据的最小单元","数据项是数据的基本单元","数据结构是带有结构的数据项的集合","一些表面上很不相同的数据可以有相同的逻辑结构","以下说法正确的是( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],225003243,[63,64,65,66],"问题的规模","待处理数据的初态","计算机的配置","A和B","算法的时间复杂度取决于( )",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":30,"type":31},[],225003244,[72,73,74,75],"树","字符串","队列","栈","以下数据结构中,( )是非线性数据结构",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":30,"type":31},[],225003245,[81,82,83,84],"O(log2n) (说明:2是底数)","O(n)","O(nlog2n) (说明:2是底数)","O(n\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F96c142883ed80ca0cbb76b1380b18756.webp\">)","设n是描述问题规模的非负整数,下面程序段的时间复杂度是( ) x=2; while(x<n\u002F2) x=2*x",{"answer":87,"createTime":5,"id":88,"options":89,"question":92,"source":30,"type":31},[],225003246,[90,82,91,84],"O(long2n) (2是底数)","O(nlog2n) (2是底数)","下列程序段的时间复杂度是( ) count=0; for(k=1;k<=n;k*=2) for(j=1;j<=n;j++) count++",{"answer":94,"createTime":5,"id":95,"options":96,"question":99,"source":30,"type":31},[],225003247,[82,97,84,98],"O(nlog2n)","O(log2n)","某算法的语句执行频度为(3n+nlog2n+n^2+8),其时间复杂度表示为()",{"answer":101,"createTime":5,"id":6,"options":102,"question":19,"source":30,"type":31},[],[8,9,10,11]]