在表长为n的顺序表上做删除运算,其时间复杂度为
A.O(1)
B.O(n)
C.O(nlog2n)
D.O(n2)
正确答案是B
扫描二维码免费使用微信小程序搜题/刷题/查看解析。
版权声明:本文由翰林刷题小程序授权发布,如需转载请注明出处。
本文链接:https://doc.20230611.cn/post/232537.html
上一篇:What context clue is used in the sentence Their greatest fear was of a conflagration,since fire would destroy their flimsy wooden settlement before help could arrive?
下一篇:与大脑皮层运动区共同控制肌肉运动,调节姿势和身体平衡的脑部结构是()2-22