What kind of argument is wrong about this optimization?关于这种优化，哪种说法是错误的？
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)中是等概率分布的话，那么在循秩访问的过程中，对列表 元素的访问次数可以节约一半。
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时。
CWhen the access to the list is concentrated at the end of the list, the effect of this optimization strategy is most pronounced.当对于列表的访问集中在列表尾部时，这种优化策略的效果最明显。
DThrough this optimization, we can make the call-by-rank time complexity better than O(n).通过这样的优化，我们可以使循秩访问时间复杂度优于O(n)。