时间的复杂性包含(对象o),在对象的ArrayList [英] Time complexity of contains(Object o), in an ArrayList of Objects
问题描述
正如标题所说我想知道什么的时间复杂度包括()一个ArrayList的方法。
O(N)
的
尺寸
,的isEmpty
,GET
,设置
,迭代器
和的ListIterator
业务在固定时间内运行。在添加
操作摊销的恒定的时间的,即,添加n个元素需要O(n)时间运行。其他所有操作都以线性时间运行(粗略地讲)。相比,LinkedList实现的常数因子较低。
块引用><一个href=\"http://download.oracle.com/javase/6/docs/api/java/util/ArrayList.html\">http://download.oracle.com/javase/6/docs/api/java/util/ArrayList.html
As the title says i was wondering what the time complexity of the contains() method of an ArrayList is.
解决方案O(n)
The
size
,isEmpty
,get
,set
,iterator
, andlistIterator
operations run in constant time. Theadd
operation runs in amortized constant time, that is, adding n elements requires O(n) time. All of the other operations run in linear time (roughly speaking). The constant factor is low compared to that for the LinkedList implementation.http://download.oracle.com/javase/6/docs/api/java/util/ArrayList.html
这篇关于时间的复杂性包含(对象o),在对象的ArrayList的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!