[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fJnug3w56mSclVT0dO3ACbBqhVuP11dFzpTIvIF9f6Ko":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2025-06-30 01:20:42",209757059,[8,9,10,11],"计算方法","排序方法","解决问题的步骤序列","调度方法",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},26,"664054f34ce8f0ac8c714249ab6f68dd","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F91606f9768d5808a7bda837639dadf26.jpg","数据结构","work_40846287","第一章绪论","计算机算法指的是",[21,33,42,45,54,63,72,78,86,95],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2025-06-30 01:20:41",209757057,[26,27,28,29],"效率","复杂性","现实性","难度","算法的计算量的大小称为计算的","v1",0,{"answer":34,"createTime":5,"id":35,"options":36,"question":41,"source":31,"type":32},[],209757058,[37,38,39,40],"问题的规模","待处理数据的初态","A和B","以上都不对","算法的时间复杂度取决于",{"answer":43,"createTime":5,"id":6,"options":44,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":46,"createTime":5,"id":47,"options":48,"question":53,"source":31,"type":32},[],209757060,[49,50,51,52],"可执行性、可移植性、可扩充性","可执行性、确定性、有穷性","确定性、有穷性、稳定性","易读性、稳定性、安全性","算法必须具备( ) 这三个特性",{"answer":55,"createTime":5,"id":56,"options":57,"question":62,"source":31,"type":32},[],209757061,[58,59,60,61],"动态结构、静态结构","顺序结构、链式结构","线性结构、非线性结构","初等结构、构造型结构","从逻辑上可以把数据结构分为( )两大类",{"answer":64,"createTime":5,"id":65,"options":66,"question":71,"source":31,"type":32},[],209757062,[67,68,69,70],"O(2n)","O(n)","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6538d45dbd08a9fcdc42d77bef1f00c2.webp\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F14e925378ae4c3ddad8fdf29aceb4a92.webp\">","在下面的程序段中,对x的赋值语句的频度为( )FOR i:=1 TO n DO FOR j:=1 TO n DO x:=x+1",{"answer":73,"createTime":5,"id":74,"options":75,"question":77,"source":31,"type":32},[],209757063,[68,70,69,76],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F67f953332c938e39f537fdf77e7e0ea1.webp\">","程序段 FOR i:=n-1 DOWNTO 1 DO FOR j:=1 TO i DO IF A[j]>A[j+1] THEN A[j]与A[j+1]对换;其中 n为正整数,则最后一行的语句频度在最坏情况下是( )",{"answer":79,"createTime":5,"id":80,"options":81,"question":85,"source":31,"type":32},[],209757064,[82,16,83,84],"数据的存储结构","数据的逻辑结构","数据元素之间的关系","数据结构在计算机内存中的表示是指",{"answer":87,"createTime":5,"id":88,"options":89,"question":94,"source":31,"type":32},[],209757065,[90,91,92,93],"逻辑","存储","逻辑和存储","物理","在数据结构中,与所使用的计算机无关的是数据的 结构",{"answer":96,"createTime":5,"id":97,"options":98,"question":102,"source":31,"type":32},[],209757066,[99,100,84,101],"数据的处理方法","数据元素的类型","数据的存储方法","在存储数据时,通常不仅要存储各数据元素的值,而且还要存储"]