导航
您当前的位置:首页 > 高教类 > 工学类
问题:

[单选题]We can consider speeding up call-by-rank by: If r>n2, then we can continue to access pred() from the tail and eventually move backwards to find the node with rank r.我们可以考虑通过如下方式加快循秩访问的速度:如果r>n2,则我们可以从尾部哨兵开始不断访问pred(),最终从后向前地找到秩为r的节点。XuW答案窝(daanwo.com)-大学生作业答案及考资分享平台
What kind of argument is wrong about this optimization?关于这种优化,哪种说法是错误的?XuW答案窝(daanwo.com)-大学生作业答案及考资分享平台
AFrom the perspective of expectation, if r is an equal probability distribution in [0,n), the number of visits to the list element can be reduced by half during the call-by-rank.从期望的角度看,r在[0,n)中是等概率分布的话,那么在循秩访问的过程中,对列表 元素的访问次数可以节约一半。XuW答案窝(daanwo.com)-大学生作业答案及考资分享平台
BThe slowest access time of origin method was mostly seen at r≈n, while the slowest access time after improvement was generally seen at r≈n/2.原有方法访问最慢的情形大致出现在r≈n时,而改进后的方法访问最慢的情形大致出现在r≈n/2时。XuW答案窝(daanwo.com)-大学生作业答案及考资分享平台
CWhen the access to the list is concentrated at the end of the list, the effect of this optimization strategy is most pronounced.当对于列表的访问集中在列表尾部时,这种优化策略的效果最明显。XuW答案窝(daanwo.com)-大学生作业答案及考资分享平台
DThrough this optimization, we can make the call-by-rank time complexity better than O(n).通过这样的优化,我们可以使循秩访问时间复杂度优于O(n)。
答案解析:

您可能感兴趣的问题
相关问题
关于我们 | 用户指南 | 版权声明 | 给我留言 | 联系我们 | 积分商城 | 答案求助 | 网站地图
Copyright © 2024 www.daanwo.com All Rights Reserved