题目内容

8. If the linear table with length n uses the sequential storage structure, the time complexity of the algorithm of inserting a new element in its ith position is ().

A. O(n)
B. O(0)
C. O(1)
D. O(n^2)

查看答案

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

更多问题

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

A. s->next=p->next;p->next=s;
B. p->next=s;s->next=p->next;
C. p->next=s;p->next=s->next;
D. p->next=s->next;p->next=s;

A. s->next=p->next;p->next=s;
B. p->next=s;s->next=p->next;
C. p->next=s;p->next=s->next;
D. p->next=s->next;p->next=s;

A. n
B. 2n-1
C. 2n
D. n-1