Pages - Menu

標籤

AWS (1) bash (1) Boost (2) C (2) CMake (2) Concurrency_Programming (3) CPP (37) Database (2) DNS (1) Docker (4) Docker-Compose (1) ELK (1) emacs (4) gcp (1) gdrive (1) git (1) gitbash (2) gitlab (1) kvm (4) Linux (5) MT4 (4) MT5 (4) Multicast (2) MySQL (2) Nijatrader8 (1) OpenCV (1) Python (4) QT5 (1) R (1) rdp (3) screenshot (1) ssh (3) Tabnine (1) TCP (1) TensorFlow (1) Tools (12) Ubuntu_1904 (11) Ubuntu_20_04 (5) UDP (1) VS2010 (1) VS2015 (1) VS2019 (1) WebServer (1) Win10 (1) winmerge (1) WSL (1) xrdp (1)

搜尋此網誌

2020年5月4日星期一

List of time complexity for standard data structure

CPP


Container Insert Append Access
Vector, String O(n) Back: O(1) or O(n) O(1)
Dequeue O(n) Front or Back: O(1) O(1)
List O(1)or O(n) O(1) O(1) or O(n)
Set, Map O(logN) - O(logN)
unordered_set, unordered_map O(1) or O(n) - O(1) or O(n)

Python

Python List ~ CPP List
Python Dict ~ CPP unordered_map
Python dequeue ~ CPP Dequeue

Big O cheat sheet

link

沒有留言:

發佈留言