Python 基本型態搜尋的時間複雜度

list

python的列表內部實現是數組,超過容量會增加更多的容量。

OperationAverage CaseAmortized Worst Case
Append[1]O(1)O(1)
InsertO(n)O(n)
Get ItemO(1)O(1)
Delete ItemO(n)O(n)
IterationO(n)O(n)
Del SliceO(n)O(n)
SortO(n log n)O(n log n)
x in sO(n)O(n)
Get LengthO(1)O(1)

dict

OperationAverage CaseAmortized Worst Case
Set Item[1]O(1)O(n)
Get ItemO(1)O(n)
Delete ItemO(1)O(n)
Iteration[2]O(n)O(n)
x in sO(1)O(n)

set

OperationAverage CaseAmortized Worst Case
Iteration[2]O(n)O(n)
x in sO(1)O(n)

Add a Comment

發佈留言必須填寫的電子郵件地址不會公開。 必填欄位標示為 *