[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fltL7PEU6kQHtlEZomDRBEM2avQ7nmv1dDFAxbZv-2MU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":27,"type":28},[],"2026-01-04 12:06:29",300970016,[8,9,10,11],"无穷性","可行性","输入和输出","确定性",{"courseId":13,"courseImg":14,"courseName":15},"8a0d95a673b3fa67279c92bdd4d311a4","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2ab81f4aa0822b462e35b55f90963db6.png","计算思维导论II","在下列选项中,不是一个算法一般应该具有的基本特征",[18,29,38,41,50,59,68,77,86,95],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],300970014,[22,23,24,25],"元素基本有序","从小到大排列好的","从大到小排列好的","元素无序","对n个不同的排序码进行冒泡排序(从小到大排序),交换的次数最多的待排序序列情形是()","v1",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],300970015,[33,34,35,36],"执行算法程序所需要的时间","算法程序的长度","算法执行过程中所需要的基本运算次数","算法程序中的指令条数","算法的时间复杂度是指",{"answer":39,"createTime":5,"id":6,"options":40,"question":16,"source":27,"type":28},[],[8,9,10,11],{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":27,"type":28},[],300970017,[45,46,47,48],"链接方式存储,元素有序","链接方式存储,元素无序","顺序方式存储,元素有序","顺序方式存储,元素无序","适用于折半查找的表的存储方式及元素排列要求为",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":27,"type":28},[],300970018,[54,55,56,57],"快速排序的时间复杂度比希尔排序的时间复杂度要小","快速排序的时间复杂度比冒泡排序的时间复杂度要小","快速排序的时间复杂度与希尔排序的时间复杂度是一样的","希尔排序的时间复杂度比直接插入排序的时间复杂度要小","在最坏情况下,关于排序算法的时间复杂度,下列说法正确的是()",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":27,"type":28},[],300970019,[63,64,65,66],"N\u002F2","N","N+1","(N+1)\u002F2","对长度为N的线性表进行顺序查找,在最坏情况下所需要的比较次数为______",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":27,"type":28},[],300970020,[72,73,74,75],"算法的表示计算机必须能理解","算法可以没有输出","算法必须具有确定性","算法必须产生正确的结果","算法设计是编写程序的基础,下列关于算法的叙述中正确的是",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":27,"type":28},[],300970021,[81,82,83,84],"(98,95,93,96,89,85,76,64,55,49)","(98,95,93,94,89,85,76,64,55,49)","(98,95,93,94,89,90,76,80,55,49)","(98,95,93,94,89,90,76,64,55,49)","下列序列中不满足堆条件的是( )",{"answer":87,"createTime":5,"id":88,"options":89,"question":94,"source":27,"type":28},[],300970022,[90,91,92,93],"一个算法的时间复杂度大,则其空间复杂度必定小","算法的时间复杂度与空间复杂度没有直接关系","一个算法的空间复杂度大,则其时间复杂度必定小","一个算法的空间复杂度大,则其时间复杂度也必定大","下列叙述中正确的是( )",{"answer":96,"createTime":5,"id":97,"options":98,"question":103,"source":27,"type":28},[],300970023,[99,100,101,102],"90","9","45","10","对长度为10的线性表进行冒泡排序,最坏情况下需要比较的次数为()"]