[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fqPQkNax5EE_SUv9QDSvpgQ3fum_-F92dlRaKYvnfyU4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-06-19 19:37:05",204748322,[8,9,10,11],"O(m)","O(n)","O(m+n)","O(m*n)",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},55,"8c1307edf66a92418f7e303e2af1b284","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa610e28bd52b29b58b43671eda69c97f.jpg","数据结构与算法","work_43851631","选择题练习","输出一个二维数组b[m][n]中所有元素值的时间复杂度为( )",[21,32,42,51,54,62,71,80,88,97],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],204748294,[25,26,27,28],"线性结构、非线性结构","初等结构、构造型结构","顺序结构、链式结构","动态结构、静态结构","从逻辑上可以把数据结构分为( )两大类","v1",0,{"answer":33,"createTime":34,"id":35,"options":36,"question":41,"source":30,"type":31},[],"2025-06-19 18:21:06",204748302,[37,38,39,40],"内部结构和外部结构","线性结构和非线性结构","顺序结构和链式结构","紧凑结构和非紧凑结构","从存储结构上可以把数据结构分成( )",{"answer":43,"createTime":34,"id":44,"options":45,"question":50,"source":30,"type":31},[],204748313,[46,47,48,49],"数据结构基本运算的实现与存储结构有关","数据的存储结构是数据的逻辑结构的计算机实现","数据结构的讨论包括数据的逻辑结构、存储结构和基本运算等三个方面","相同的逻辑结构对应的存储结构必然也相同","以下关于数据结构的说法中错误的是( )",{"answer":52,"createTime":5,"id":6,"options":53,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":55,"createTime":5,"id":56,"options":57,"question":61,"source":30,"type":31},[],204748330,[58,9,59,60],"O(2n)","O(nlogn)","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8931b0db2b5b97c1fb2faa868a2d312b.png\">","设S为C语言的语句,计算机执行下面算法时,算法的时间复杂度为( ).for(i=n-1;i>=0;i--) for(j=0;j<i;j++) S",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],204748340,[66,67,68,69],"空间复杂性和时间复杂性","可读性和文档性","数据复杂性和程序复杂性","正确性和简明性","算法分析的两个主要方面是( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],204748347,[75,76,77,78],"可行性","正确性","输入性","健壮性","对于一个算法,当输入非法数据时,也要能作出相应的处理,这种要求称为( )",{"answer":81,"createTime":82,"id":83,"options":84,"question":87,"source":30,"type":31},[],"2025-06-19 19:37:06",204748359,[85,86,9,60],"O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9d0553cdf09499c3739e421156b9f91c.png\">)","O(n\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9d0553cdf09499c3739e421156b9f91c.png\">)","下列程序段的时间复杂度是( ). x=1; while(x<n) x=2*x",{"answer":89,"createTime":34,"id":90,"options":91,"question":96,"source":30,"type":31},[],204748367,[92,93,94,95],"100","99","100.5","99.5","向一个有200个元素的顺序表中等概率删除其中任一元素,平均要移动的元素个数为( )",{"answer":98,"createTime":82,"id":99,"options":100,"question":101,"source":30,"type":31},[],204748376,[93,95,94,92],"向一个有200个元素的顺序表中等概率插入其中任一元素,平均要移动的元素个数为( )"]