[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fTBAQVUIqZEkE1Ip5eXvNI7bzahx_FMMrmOawTYFZ7zc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-05-11 19:00:46",5928399,[8,9,10,11],"递归法","枚举法","选择法","比较法",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},13,"1066295735f61ae91d1ff83304b9108c","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F661c740174c3a11f1700217a13b095fe.png","算法实现与应用技术","29f4103361eb4f3584ba1ec84d80c2c9","第10章 测验题","斐波那契数列:1、1、2、3、5、8、13、21、…… ,如果设F(n)为该数列的第n项(n∈N+) .那么这句话可以写成如下形式:F(0) = 0,F(1)=F(2)=1,F(n)=F(n-1)+F(n-2) (n≥3).可以利用下列哪个方法实现( )",[21,32,41,50,53,62,71,76,81,86],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],5928396,[25,26,27,28],"5,11,33","8,33","11,45,33","11,33","报名参加冬季越野赛跑的某班5位学生的学号是:5,8,11,33,45.利用对分查找,查找学号为33号学生的过程中,依次被访问到的学号是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],5928397,[36,37,38,39],"61,45,49,46,58,57","61,58,57,49,45,46","61,58,57,46,45,49","61,58,49,46,45,57","有6位裁判为运动员评分,给出的分数分别为49,45,61,46,58,57.采用选择排序算法对其进行排序,若完成第一遍时的结果为:61,45,49,46,58,57,则完成第二遍时的结果是( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],5928398,[45,46,47,48],"5","4","3","2","某校有5位学生参加学生会主席竞选,得票数依次为110,98,3,150,67.使用选择排序的方法对得票数进行从大到小排序,需要进行数据互换的次数是( )",{"answer":51,"createTime":5,"id":6,"options":52,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],5928400,[57,58,59,60],"把杂乱无章的数据变为从小到大排列的数据","把杂乱无章的数据变为从大到小排列的数据","把杂乱无章的数据变为有序的数据","以上说法都错误","在使用计算机处理数据的过程中,往往需要对数据进行排序,所谓排序就是:( )",{"answer":63,"createTime":64,"id":65,"options":66,"question":69,"source":30,"type":70},[],"2023-05-12 00:06:09",6851656,[67,68],"正确","错误","在定义一个过程或函数时出现调用本过程或本函数的成分,称之为递归(Recursion)",3,{"answer":72,"createTime":64,"id":73,"options":74,"question":75,"source":30,"type":70},[],6851657,[67,68],"递归调用的次数可以是无穷的",{"answer":77,"createTime":64,"id":78,"options":79,"question":80,"source":30,"type":70},[],6851658,[67,68],"递归分为直接递归和间接递归.若调用自身,则称之为直接递归",{"answer":82,"createTime":64,"id":83,"options":84,"question":85,"source":30,"type":70},[],6851659,[67,68],"若循环方式的算法和递归方式的算法均能求解某个问题,通常循环方式算法的实际复杂度要比递归方式算法的时间复杂度高",{"answer":87,"createTime":64,"id":88,"options":89,"question":90,"source":30,"type":70},[],6851660,[67,68],"排序(sorting)是将指定数据集合中的元素按照一定的标准来安排先后次序的过程"]