[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f7djMEad38YUq1nUtNk1nikhjZWr_R03Qhuz8LMu5xOM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":27,"type":28},[],"2023-09-25 17:56:41",98300332,[8,9,10,11],"n-i","n-i+1","n-i-1","i",{"courseId":13,"courseImg":14,"courseName":15},"7c3b97f0810b2af6b6801c0564f2889f","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc230bca798c241d37d01471b81840694.jpg","数据结构","在一个长度为n的顺序表中,在第i个元素(1≤i≤n+1)之前插入一个新元素时须向后移动( )个元素",[18,29,38,47,56,65,74,83,92,95],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],98300317,[22,23,24,25],"110","108","100","120","第2章 线性表1.选择题(1)一个向量第一个元素的存储地址是100,每个元素的长度为2,则第5个元素的地址是( )","v1",1,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],98300320,[33,34,35,36],"访问第i个结点(1≤i≤n)和求第i个结点的直接前驱(2≤i≤n)","在第i个结点后插入一个新结点(1≤i≤n)","删除第i个结点(1≤i≤n)","将n个结点从小到大排序","在n个结点的顺序表中,算法的时间复杂度是O(1)的操作是( )",{"answer":39,"createTime":5,"id":40,"options":41,"question":46,"source":27,"type":28},[],98300321,[42,43,44,45],"8","63.5","63","7","向一个有127个元素的顺序表中插入一个新元素并保持原来顺序不变,平均要移动 的元素个数为( )",{"answer":48,"createTime":5,"id":49,"options":50,"question":55,"source":27,"type":28},[],98300322,[51,52,53,54],"分两部分,一部分存放结点值,另一部分存放表示结点间关系的指针","只有一部分,存放结点值","只有一部分,存储表示结点间关系的指针","分两部分,一部分存放结点值,另一部分存放结点所占单元数","链接存储的存储结构所占存储空间( )",{"answer":57,"createTime":5,"id":58,"options":59,"question":64,"source":27,"type":28},[],98300323,[60,61,62,63],"必须是连续的","部分地址必须是连续的","一定是不连续的","连续或不连续都可以","线性表若采用链式存储结构时,要求内存中可用存储单元的地址( )",{"answer":66,"createTime":5,"id":67,"options":68,"question":73,"source":27,"type":28},[],98300325,[69,70,71,72],"需经常修改L中的结点值","需不断对L进行删除插入","L中含有大量的结点","L中结点结构复杂","线性表L在( )情况下适用于使用链式结构实现",{"answer":75,"createTime":5,"id":76,"options":77,"question":82,"source":27,"type":28},[],98300327,[78,79,80,81],"大于1","等于1","小于1","不能确定","单链表的存储密度( )",{"answer":84,"createTime":5,"id":85,"options":86,"question":91,"source":27,"type":28},[],98300328,[87,88,89,90],"n","2n-1","2n","n-1","将两个各有n个元素的有序表归并成一个有序表,其最少的比较次数是( )",{"answer":93,"createTime":5,"id":6,"options":94,"question":16,"source":27,"type":28},[],[8,9,10,11],{"answer":96,"createTime":5,"id":97,"options":98,"question":103,"source":27,"type":28},[],98300336,[99,100,101,102],"每个元素都有一个直接前驱和一个直接后继","线性表中至少有一个元素","表中诸元素的排列必须是由小到大或由大到小","除第一个和最后一个元素外,其余每个元素都有一个且仅有一个直接前驱和直接后继","线性表L=(a1,a2,……an),下列说法正确的是( )"]