题目内容

在顺序表中访问任意一结点的时间复杂度均为______，因此，顺序表也称为随机存取（RandomAccess）的数据结构。

A. O(1)
B. O(n)
C. O(logn)
D. O(n*n)

查看答案

搜索结果不匹配？点我反馈

更多问题

曲则全，( ) ，洼则盈，敝则新，少则得，多则惑。是以圣人抱一为天下式

There are twenty __________ in our hospital.

A. woman doctors
B. women doctor
C. women doctors
D. woman doctor

__________ are usually careful in doing exercises.

A. Girl students
B. Girls students
C. Girls’ students
D. Girl’s students

They have many_______ English books than we.

A. more
B. many
C. most
D. more many