[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fK7x4Mv4jZ2pCyhWNm64c01zgw2qdNNUPtP40E-L6YYc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":27,"type":44},[],"2024-06-15 22:49:34",151867175,[8,9,10,11],"O(1)","O(n)","O(nlogn)","O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F49bbed2240877f44a2a5de969cfde1a5.png\">)",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},17,"f4c2bb378031389ef44eaf8c5a64d78d","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F530655c8ef07a491c6d93c29109d2c7b.jpg","数据结构与算法","work_35515219","9.5 测试题","直接插入排序算法在最好情形下的时间复杂度为( )",[21,29,35,45,54,63,72,79,88,97],{"answer":22,"createTime":23,"id":24,"options":25,"question":26,"source":27,"type":28},[],"2024-06-15 22:49:32",151867166,[],"设有一组关键字{32,13,49,24,38,21,4,12},其哈希函数为H(key)=key%7,分别采用线性探测法和拉链法解决冲突,试在0~9的哈希地址空间中对该关键字序列构造哈希表,并求等概率下查找成功和查找失败的平均查找长度","v1",4,{"answer":30,"createTime":31,"id":32,"options":33,"question":34,"source":27,"type":28},[],"2024-06-15 22:49:33",151867167,[],"已知序列(27,91,1,97,17,23,84),请分别给出采用冒泡排序法、快速排序法每一趟的排序结果",{"answer":36,"createTime":31,"id":37,"options":38,"question":43,"source":27,"type":44},[],151867168,[39,40,41,42],"两个元素具有相同的序号","两个元素的关键字不同,而其它属性相同","数据元素过多","两个元素的关键字不同,而对应的哈希函数值相同","哈希表中出现的哈希冲突是指( )",0,{"answer":46,"createTime":31,"id":47,"options":48,"question":53,"source":27,"type":44},[],151867169,[49,50,51,52],"在采用拉链法解决冲突时,成功查找到任何一个元素的时间都是相同的","在采用拉链法解决冲突时容易引起堆积现象","在采用拉链法解决冲突时,若采用头插法插入元素,则插入任何一个元素的时间总是相同的","以上都不对","下列关于哈希表查找的说法中正确的是( )",{"answer":55,"createTime":31,"id":56,"options":57,"question":62,"source":27,"type":44},[],151867170,[58,59,60,61],"在哈希查找中不需要任何关键字的比较","在采用拉链法解决冲突时,查找每个元素的时间是相同的","哈希表在查找成功时的平均查找长度仅与表长有关","哈希表的装填因子等于表中填入的元素个数除以哈希表的长度","以下关于哈希查找的叙述中正确的是( )",{"answer":64,"createTime":31,"id":65,"options":66,"question":71,"source":27,"type":44},[],151867171,[67,68,69,70],"这两个元素的前后位置一定发生变化","这两个元素的前后位置可能发生变化","这两个元素的前后位置不发生变化","这两个元素的位置不发生变化","若数据序列中含有两个关键字相同的元素,通过不稳定的排序算法排序后,( )",{"answer":73,"createTime":31,"id":74,"options":75,"question":78,"source":27,"type":44},[],151867172,[9,76,77,10],"O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7480fe73b37a9ad0890e4fc5e7bfd381.png\">)","O(logn)","快速排序的平均时间复杂度为( )",{"answer":80,"createTime":31,"id":81,"options":82,"question":87,"source":27,"type":44},[],151867173,[83,84,85,86],"排序的数据量太大","排序的数据中含有多个相同值","排序的数据个数为奇数","排序的数据已基本有序","快速排序在( )情况下最不利于发挥其长处",{"answer":89,"createTime":31,"id":90,"options":91,"question":96,"source":27,"type":44},[],151867174,[92,93,94,95],"快速排序","归并排序","基数排序","堆排序","在以下排序方法中,( )不需要进行关键字的比较",{"answer":98,"createTime":5,"id":6,"options":99,"question":19,"source":27,"type":44},[],[8,9,10,11]]