About vector and the following list, which is wrong:下列关于向量和列表的说法错误的是：
AVectors usually occupy continuous space in memory, but the list is usually not the case向量通常在内存中占据连续的空间，列表则通常不是如此
BFinding in ordered vectors is progressively faster than finding in ordered lists在有序向量中查找渐进地比在有序列表中查找快
CThe time complexity of merging sorting in vector is O(nlog2(n)), and in list is Ω(n2)向量归并排序的时间复杂度是O(nlog2(n))，而列表为Ω(n2)
DDeleting single node in List progressively faster than that in vectors. 列表删除单个节点渐进地比向量删除单个元素快