zoukankan      html  css  js  c++  java
  • python中各种结构的复杂度

    list

    The Average Case assumes parameters generated uniformly at random.

    Internally, a list is represented as an array; the largest costs come from growing beyond the current allocation size (because everything must move), or from inserting or deleting somewhere near the beginning (because everything after that must move). If you need to add/remove at both ends, consider using a collections.deque instead.

    Operation

    Average Case

    Amortized Worst Case

    Copy

    O(n)

    O(n)

    Append[1]

    O(1)

    O(1)

    Insert

    O(n)

    O(n)

    Get Item

    O(1)

    O(1)

    Set Item

    O(1)

    O(1)

    Delete Item

    O(n)

    O(n)

    Iteration

    O(n)

    O(n)

    Get Slice

    O(k)

    O(k)

    Del Slice

    O(n)

    O(n)

    Set Slice

    O(k+n)

    O(k+n)

    Extend[1]

    O(k)

    O(k)

    Sort

    O(n log n)

    O(n log n)

    Multiply

    O(nk)

    O(nk)

    x in s

    O(n)

    min(s), max(s)

    O(n)

    Get Length

    O(1)

    O(1)

    collections.deque

    A deque (double-ended queue) is represented internally as a doubly linked list. (Well, a list of arrays rather than objects, for greater efficiency.) Both ends are accessible, but even looking at the middle is slow, and adding to or removing from the middle is slower still.

    Operation

    Average Case

    Amortized Worst Case

    Copy

    O(n)

    O(n)

    append

    O(1)

    O(1)

    appendleft

    O(1)

    O(1)

    pop

    O(1)

    O(1)

    popleft

    O(1)

    O(1)

    extend

    O(k)

    O(k)

    extendleft

    O(k)

    O(k)

    rotate

    O(k)

    O(k)

    remove

    O(n)

    O(n)

    set

    See dict -- the implementation is intentionally very similar.

    Operation

    Average case

    Worst Case

    x in s

    O(1)

    O(n)

    Union s|t

    O(len(s)+len(t))

    Intersection s&t

    O(min(len(s), len(t))

    O(len(s) * len(t))

    Difference s-t

    O(len(s))

    s.difference_update(t)

    O(len(t))

    Symmetric Difference s^t

    O(len(s))

    O(len(s) * len(t))

    s.symmetric_difference_update(t)

    O(len(t))

    O(len(t) * len(s))

    • As seen in the source code the complexities for set difference s-t or s.difference(t) (set_difference()) and in-place set difference s.difference_update(t) (set_difference_update_internal()) are different! The first one is O(len(s)) (for every element in s add it to the new set, if not in t). The second one is O(len(t)) (for every element in t remove it from s). So care must be taken as to which is preferred, depending on which one is the longest set and whether a new set is needed.

    • To perform set operations like s-t, both s and t need to be sets. However you can do the method equivalents even if t is any iterable, for example s.difference(l), where l is a list.

    dict

    The Average Case times listed for dict objects assume that the hash function for the objects is sufficiently robust to make collisions uncommon. The Average Case assumes the keys used in parameters are selected uniformly at random from the set of all keys.

    Note that there is a fast-path for dicts that (in practice) only deal with str keys; this doesn't affect the algorithmic complexity, but it can significantly affect the constant factors: how quickly a typical program finishes.

    Operation

    Average Case

    Amortized Worst Case

    Copy[2]

    O(n)

    O(n)

    Get Item

    O(1)

    O(n)

    Set Item[1]

    O(1)

    O(n)

    Delete Item

    O(1)

    O(n)

    Iteration[2]

    O(n)

    O(n)







  • 相关阅读:
    Tomcat的startup.bat启动后显示乱码--windows终端
    Java 文件组织形式
    连接Linux之win10子系统Linux安装与使用(一)
    连接Linux之win10子系统Linux安装与使用(二)
    vscode omnisharp server load timed out
    在唯一密钥属性“fileExtension”设置为“.json”时,无法添加类型为“mimeMap”的重复集合项
    vscode编译发布exe
    MySQL数据库一般设计规则
    .Net开发常用工具插件
    linx下对文件权限设置
  • 原文地址:https://www.cnblogs.com/MrLJC/p/4126562.html
Copyright © 2011-2022 走看看