[알고리즘] ArrayList 메서드별 시간 복잡도

size(): O(1)

isEmpty(): O(1)

get(): O(1)

set(): O(1)

iterator(): O(1)

listIterator(): O(1)

add(E e): O(1) (amortized time)

add(int index, E e): O( index 오른쪽 배열 크기) (amortized time)

remove(): O(n)
removeRange(int fromIndex, int toIndex): O(n - fromIndex)

indexOf(): O(n)

contains(): O(n)

addAll(E e): O(m) (넣는 배열 크기)

addAll(int index, E e): O(n + m)

sort(): O(nlogn)

ensureCapacity: O(n) ?

clear(): O(n)