[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fRz-JGlhaEyUBKA6ATh8MivgdnfEX8kOnvsUoHO479vA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":27,"type":28},[],"2025-12-19 04:24:16",273242300,[8,9,10,11],"无穷性","可行性","确定性","有穷性",{"courseId":13,"courseImg":14,"courseName":15},"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","下列选项中,哪个不是一般算法应该有的特征( )",[18,29,37,46,54,57,66,74,83,92],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],273242292,[22,23,24,25],"算法的执行时间","算法所处理数据和数据量","算法程序中的语句或指令条数","算法在实现过程中所需要的基本运算次数","算法的时间复杂度是指( )","v1",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":36,"source":27,"type":28},[],273242294,[33,34,24,35],"算法在执行过程中所需要的计算机存储空间","算法所处理的数据量","算法在执行过程中所需要的临时工作单元数","算法的空间复杂度是指( )",{"answer":38,"createTime":5,"id":39,"options":40,"question":45,"source":27,"type":28},[],273242296,[41,42,43,44],"一个算法的空间复杂度大,则其时间复杂度也必定大","一个算法的空间复杂度大,则其时间复杂度必定小","一个算法的时间复杂度大,则其空间复杂度必定小","上述三种说法都不对","下列叙述中正确的是( )",{"answer":47,"createTime":5,"id":48,"options":49,"question":45,"source":27,"type":28},[],273242298,[50,51,52,53],"算法的效率只与问题的规模有关,而与数据的存储结构无关","算法的时间复杂度是指执行算法所需要的计算工作量","数据的逻辑结构与存储结构是一一对应的","算法的时间复杂度与空间复杂度一定相关",{"answer":55,"createTime":5,"id":6,"options":56,"question":16,"source":27,"type":28},[],[8,9,10,11],{"answer":58,"createTime":5,"id":59,"options":60,"question":65,"source":27,"type":28},[],273242302,[61,62,63,64],"算法程序的运行时间是有限的","算法程序所处理的数据量是有限的","算法程序的长度是有限的","算法只能被有限的用户使用","算法的有穷性是指( )",{"answer":67,"createTime":5,"id":68,"options":69,"question":45,"source":27,"type":28},[],273242304,[70,71,72,73],"所谓算法就是计算方法","程序可以作为算法的一种描述方法","算法设计只需考虑得到计算结果","算法设计可以忽略算法的运算时间",{"answer":75,"createTime":5,"id":76,"options":77,"question":82,"source":27,"type":28},[],273242306,[78,79,80,81],"最坏情况下的时间复杂度一定高于平均情况的时间复杂度","时间复杂度与所用的计算工具无关","对同一个问题,采用不同的算法,则它们的时间复杂度是相同的","时间复杂度与采用的算法描述语言有关","下列关于算法复杂度叙述正确的是( )",{"answer":84,"createTime":5,"id":85,"options":86,"question":91,"source":27,"type":28},[],273242308,[87,88,89,90],"一种在一定范围内尝试所有可能的解决方案以找到问题的答案的算法","一种自顶向下的算法,用于将问题分解成更小的子问题","一种使用动态分配内存的算法","一种用于图像处理的算法","穷举法是什么算法?( )",{"answer":93,"createTime":5,"id":94,"options":95,"question":100,"source":27,"type":28},[],273242309,[96,97,98,99],"迭代递推使用循环结构,递归使用函数调用","递归比迭代递推更快","迭代递推和递归没有区别","递归比迭代递推更节省内存","迭代递推与递归的区别是什么?( )"]