Skip to content

Python list 자료형 메서드의 시간복잡도 #5

Description

@SangJunni
Operation 코드 예시 시간복잡도
인덱싱 L[i] O(1)
길이 len(L) O(1)
Append L.append(i) O(1)
Pop L.pop() O(1)
Clear L.clear(0) O(1)
Slice L[a:b] O(b-a)
list 생성 list() O(len(L))
삽입 L.insert(pos, val) O(N)
Delete del L[pos] O(N)
포함 여부 x in L O(N)
복사 L.copy() O(N)
Remove L.remove(val) O(N)
Pop(i) L.pop(i) O(N)
Reverse L.reverse() O(N)
Sort L.sort() O(N*logN)
Multiply k * L O(k*l)

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions