[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f59w0ay3HGYgPyb7bU04dLByN0mD4UNLofnKPMhXccbM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-12-15 22:04:55",171330606,[8,9,10,11],"找出数据结构的合理性","研究算法中输入和输出的关系","分析算法的效率以求改进","分析算法的易读性和可行性",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},110,"67283bba0503bdd4c3dc61ca6d7c5acc","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","算法设计与分析","work_39306369","综合练习","算法分析的目的是( )",[21,33,40,49,58,67,70,79,88,97],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2024-12-15 22:04:54",171330596,[26,27,28,29],"123","213","413","134","以下代码输出的结果为: # include <stdio.h># include <vector>using namespace std;int main(){ vector<int> myv; vector<int>::iterator it; myv.push_back(1); it = myv.begin(); myv.insert(it,2); myv.push_back(3); it = myv.begin(); myv.insert(it,4); myv.erase(it); for(it=myv.begin();it!=myv.end();it++){ printf("%d",*it); }}","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":39,"source":31,"type":32},[],171330598,[26,27,37,38],"312","321","以下代码输出的结果为: # include <stdio.h> # include <queue> using namespace std; int main(){ priority_queue<int> qu; qu.push(2); qu.push(1); qu.push(3); while(!qu.empty()){ printf("%d",qu.top()); qu.pop(); } }",{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":31,"type":32},[],171330600,[44,45,46,47],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe152521bc087a007209c63d7d2b5a7c9.webp\">","o(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2815196056c8a054360d9b1c86374fd5.webp\">)","o(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff35140365daa1c7f03504cf8da491be0.webp\">)","以上都不对","在下面的程序段中,对x的赋值语句的频度为______(表示为n的函数) for(int i=1 ; i< n; ++i) for(int j=1; j< i; ++j) for(int k=1; k< j; ++k) x =x+delta",{"answer":50,"createTime":5,"id":51,"options":52,"question":57,"source":31,"type":32},[],171330602,[53,54,55,56],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F178fc3d558fb918cf850ff3699c865b8.png\">","O(n)","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F287043e77df83b759fd1109266f5ebb7.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F20a8f5ecf1c937432e68dc6937538034.png\">","设n是描述问题规模的非负整数,下面程序片段的时间复杂度为( ). int x= 2; while (x<n\u002F2) x =2* x",{"answer":59,"createTime":5,"id":60,"options":61,"question":66,"source":31,"type":32},[],171330604,[62,63,64,65],"o(n)","o(logn)","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F63bafc87ef2b6b9e3afcc5d86a11174f.webp\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3a9fcb6dcb664c9573c82e774826edb1.webp\">","设n是偶数,试计算运行下列程序段后m的值并给出该程序段的时间复杂度. m=0; for(int i=1 ; i< n; ++i) for(int j=2*i; j> n; --j) m=m+1",{"answer":68,"createTime":5,"id":6,"options":69,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":31,"type":32},[],171330608,[74,75,76,77],"算法最终必须由计算机程序实现","算法等同于程序","算法的可行性是指指令不能有二义性","以上几个都是错误的","以下关于算法的说法中正确的是( )",{"answer":80,"createTime":5,"id":81,"options":82,"question":87,"source":31,"type":32},[],171330610,[83,84,85,86],"问题规模是n^2","执行时间等于n^2","执行时间与n^2成正比","问题规模与n^2成正比","某算法的时间复杂度为O(n^2),表明该算法的( )",{"answer":89,"createTime":5,"id":90,"options":91,"question":96,"source":31,"type":32},[],171330612,[92,93,94,95],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6c627495f8c2cef2421a1d38ec057729.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9b601bdd1b15983164e067eaee4a0cff.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F477fce0b602debfadc9d98f2734718f2.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc3e8ff124de1374a3eed9fa84d30cf04.png\">","下列选项不正确的是( )",{"answer":98,"createTime":5,"id":99,"options":100,"question":105,"source":31,"type":32},[],171330614,[101,102,103,104],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F81e0fffed40bbe3be0d89af31e1dd3b2.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7673030d1b137fbb15bde3f723bf128a.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff5a4062d74b547e263f9bcb8b37dc746.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe98ea7cceb996bbc2f08d250aebf7c49.png\">","当输入规模为n时,以下算法增长率最大的是( )"]