[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fjmZbk_aRK59CpTazbqJ2q-L81E_oJw5W9vUGnX4TfUE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2025-06-19 19:37:08",204748716,[8,9,10,11],"13,27,38,49,65,76,97","27,38,13,49,76,97,65","38,13,27,49,65,97,76","7,38,65,49,76,13,27",{"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","选择题练习","对记录序列(49,38,65,97,76,13,27)进行快速排序,一趟划分之后所得结果为( )",[21,33,43,52,61,69,78,87,95,104],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2025-06-19 19:37:05",204748294,[26,27,28,29],"线性结构、非线性结构","初等结构、构造型结构","顺序结构、链式结构","动态结构、静态结构","从逻辑上可以把数据结构分为( )两大类","v1",0,{"answer":34,"createTime":35,"id":36,"options":37,"question":42,"source":31,"type":32},[],"2025-06-19 18:21:06",204748302,[38,39,40,41],"内部结构和外部结构","线性结构和非线性结构","顺序结构和链式结构","紧凑结构和非紧凑结构","从存储结构上可以把数据结构分成( )",{"answer":44,"createTime":35,"id":45,"options":46,"question":51,"source":31,"type":32},[],204748313,[47,48,49,50],"数据结构基本运算的实现与存储结构有关","数据的存储结构是数据的逻辑结构的计算机实现","数据结构的讨论包括数据的逻辑结构、存储结构和基本运算等三个方面","相同的逻辑结构对应的存储结构必然也相同","以下关于数据结构的说法中错误的是( )",{"answer":53,"createTime":23,"id":54,"options":55,"question":60,"source":31,"type":32},[],204748322,[56,57,58,59],"O(m)","O(n)","O(m+n)","O(m*n)","输出一个二维数组b[m][n]中所有元素值的时间复杂度为( )",{"answer":62,"createTime":23,"id":63,"options":64,"question":68,"source":31,"type":32},[],204748330,[65,57,66,67],"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":70,"createTime":23,"id":71,"options":72,"question":77,"source":31,"type":32},[],204748340,[73,74,75,76],"空间复杂性和时间复杂性","可读性和文档性","数据复杂性和程序复杂性","正确性和简明性","算法分析的两个主要方面是( )",{"answer":79,"createTime":23,"id":80,"options":81,"question":86,"source":31,"type":32},[],204748347,[82,83,84,85],"可行性","正确性","输入性","健壮性","对于一个算法,当输入非法数据时,也要能作出相应的处理,这种要求称为( )",{"answer":88,"createTime":89,"id":90,"options":91,"question":94,"source":31,"type":32},[],"2025-06-19 19:37:06",204748359,[92,93,57,67],"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":96,"createTime":35,"id":97,"options":98,"question":103,"source":31,"type":32},[],204748367,[99,100,101,102],"100","99","100.5","99.5","向一个有200个元素的顺序表中等概率删除其中任一元素,平均要移动的元素个数为( )",{"answer":105,"createTime":89,"id":106,"options":107,"question":108,"source":31,"type":32},[],204748376,[100,102,101,99],"向一个有200个元素的顺序表中等概率插入其中任一元素,平均要移动的元素个数为( )"]