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