[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fETtQz1iq0JyaDI3bccJPlUWyMDaQAhRqn1MkfXrMUUU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2025-05-06 21:21:46",185983374,[8,9,10,11],"解决","分解","合并","阶段划分",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},35,"0edf8759046cb153394b7ee865949b10","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","算法设计及应用","exam_153268195","23科技1、2班第二次测试","以下不是分治策略步骤的是( )",[21,26,35,44,53,62,71,80,89,98],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":5,"id":28,"options":29,"question":34,"source":24,"type":25},[],185983377,[30,31,32,33],"O(n2)","O(n)","O(nlogn)","O(n3)","如下程序段n为正整数,最后一行的语句频度在最坏情况下是( ). for(i=n-1;i>=1;i--) for(j=1;j<=i;j++) if(A[j]>A[j+1]) temp=A[j];A[j]=A[j+1];A[j+1]=temp",{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":24,"type":25},[],185983380,[39,40,41,42],"算法就是某个问题的解题过程","算法执行后可以产生不同的结果","解决某一个具体问题算法不同结果不同","算法执行步骤的次数不可以为很大,否则无法实施","下列关于算法的说法中,正确的是( )",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":24,"type":25},[],185983382,[48,49,50,51],"事前统计的方法","事后统计的方法","事前分析估算的方法","事后分析估算的方法","计算算法的时间复杂度是属于一种( )",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":24,"type":25},[],185983384,[57,58,59,60],"设置入口条件、控制回溯","分析问题、找出递归关系","控制递归次数、避免溢出","设计函数、确定参数","在使用递归结构进行算法设计时,步骤不包括( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":24,"type":25},[],185983386,[66,67,68,69],"有穷性","可维护性","健壮性","可读性","算法的( )是指算法主要是为了方便人的阅读与交流,其次才是让计算机执行",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":24,"type":25},[],185983388,[75,76,77,78],"递归初值","递归终止条件","递推方程式","递归结论","递归的关键在于找出递归方程式和( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":24,"type":25},[],185983390,[84,85,86,87],"执行时间等于n2","执行时间与n2成正比","问题规模与n2成正比","问题规模是n2","某算法的时间复杂度为O(n2),表明该算法的( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":24,"type":25},[],185983391,[93,94,95,96],"算法策略决定数据结构","逻辑结构要便于存储实现","数据结构要方便实现","存储方式要考虑数据规模","在算法设计时要对处理的数据选择适当的数据结构,具体应该考虑的问题不包括( )",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":24,"type":25},[],185983393,[102,103,104,105],"预排序与递归调用","重叠子问题与贪心选择性质","最优子结构与重叠子问题","最优子结构与无后向性","能采用贪心算法求最优解的问题,一般具有的重要性质为( )"]