[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fr1IPtFROGo0OqgZ0qH4ZBV8RKGIb7Z4NNfbUDRsDkl0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-06-09 10:44:21",54693014,[8,9,10,11],"可读性和文档性","正确性和简单性","数据复杂性和程序复杂性","空间复杂度和时间复杂度",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},471,"f185adf9cb155c4a3b436961448aa8c2","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fbfe427f6c09d39bd6109613241691cca.png","数据结构","work_28139078","homework","算法分析的两个主要方面是( )",[21,32,35,44,53,62,71,79,88,95],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],54693013,[25,26,27,28],"数据的逻辑结构和存储结构","数据的存储结构","数据的逻辑结构、存储结构及其基本操作","数据的逻辑结构","研究数据结构就是研究( ).","v1",0,{"answer":33,"createTime":5,"id":6,"options":34,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":30,"type":31},[],54693015,[39,40,41,42],"栈","图","树","广义表","具有线性结构的数据结构是( )",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":30,"type":31},[],54693016,[48,49,50,51],"O(m+n)","O(m2)","O(n2)","O(m*n)","下面程序段的时间复杂度是( ).for(i=0;i<m;i++)for (j=0; j<n;j++)a[i][j]=i*j",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],54693017,[57,58,59,60],"计算机程序","解决问题的有限运算序列","解决问题的计算方法","排序算法","算法是( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],54693018,[66,67,68,69],"O(n)","0(log2n)","O(nlog2n)","O(n^2)",",其时间复杂度表示( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":78,"source":30,"type":31},[],54693019,[75,76,66,77],"O(3n)","O(1og3n)","O(n3)","下面程序段的时间复杂度为( ).i=1;while(i<=n)i=i*3",{"answer":80,"createTime":5,"id":81,"options":82,"question":87,"source":30,"type":31},[],54693020,[83,84,85,86],"关系","算法","结构","运算","和运算等的学科",{"answer":89,"createTime":5,"id":90,"options":91,"question":94,"source":30,"type":31},[],54693021,[92,66,93,69],"O(1og2n)","O(n^3)","{i++;s+=i;}",{"answer":96,"createTime":5,"id":97,"options":98,"question":103,"source":30,"type":31},[],54693022,[99,100,101,102],"健壮性当环境发生变化时,算法能适当地做出反应或进行处理,不会产生不需要的运行结果","易读性算法应易于阅读和理解,以便调试、修改和扩充","高效性即达到所需要的时间性能","正确性算法应能正确地实现预定的功能","通常从正确性、易读性、健壮性、高效性等4个方面评价算法的质量,以下解释错误的是( )"]