Big O Flashcards
(120 cards)
1
Q
Array average access time complexity
A
O(1)
2
Q
Array List average search time complexity
A
O(n)
3
Q
Array average insertion time complexity
A
O(n)
4
Q
Array average deletion time complexity
A
O(n)
5
Q
Array worst access time complexity
A
O(1)
6
Q
Array worst search time complexity
A
O(n)
7
Q
Array worst insertion time complexity
A
O(n)
8
Q
Array worst deletion time complexity
A
O(n)
9
Q
Array worst space time complexity
A
O(n)
10
Q
Stack average access time complexity
A
O(n)
11
Q
Stack List average search time complexity
A
O(n)
12
Q
Stack average insertion time complexity
A
O(1)
13
Q
Stack average deletion time complexity
A
O(1)
14
Q
Stack worst access time complexity
A
O(n)
15
Q
Stack worst search time complexity
A
O(n)
16
Q
Stack worst insertion time complexity
A
O(1)
17
Q
Stack worst deletion time complexity
A
O(1)
18
Q
Stack worst space time complexity
A
O(n)
19
Q
Queue average access time complexity
A
O(n)
20
Q
Queue average search time complexity
A
O(n)
21
Q
Queue average insertion time complexity
A
O(1)
22
Q
Queue average deletion time complexity
A
O(1)
23
Q
Queue worst access time complexity
A
O(n)
24
Q
Queue worst search time complexity
A
O(n)
25
Queue worst insertion time complexity
O(1)
26
Queue worst deletion time complexity
O(1)
27
Queue worst space time complexity
O(n)
28
Singly-Linked List average access time complexity
O(n)
29
Singly-Linked List average search time complexity
O(n)
30
Singly-Linked List average insertion time complexity
O(1)
31
Singly-Linked List average deletion time complexity
O(1)
32
Singly-Linked List worst access time complexity
O(n)
33
Singly-Linked List worst search time complexity
O(n)
34
Singly-Linked List worst insertion time complexity
O(1)
35
Singly-Linked List worst deletion time complexity
O(1)
36
Singly-Linked List worst space time complexity
O(n)
37
Doubly-Linked List average access time complexity
O(n)
38
Doubly-Linked List average search time complexity
O(n)
39
Doubly-Linked List average insertion time complexity
O(1)
40
Doubly-Linked List average deletion time complexity
O(1)
41
Doubly-Linked List worst access time complexity
O(n)
42
Doubly-Linked List worst search time complexity
O(n)
43
Doubly-Linked List worst insertion time complexity
O(1)
44
Doubly-Linked List worst deletion time complexity
O(1)
45
Doubly-Linked List worst space time complexity
O(n)
46
Skip List average access time complexity
O(log(n))
47
Skip List average search time complexity
O(log(n))
48
Skip List average insertion time complexity
O(log(n))
49
Skip List average deletion time complexity
O(log(n))
50
Skip List worst access time complexity
O(n)
51
Skip List worst search time complexity
O(n)
52
Skip List worst insertion time complexity
O(n)
53
Skip List worst deletion time complexity
O(n)
54
Skip List worst space time complexity
O(n log(n))
55
Hash Table average search time complexity
O(1)
56
Hash Table average insertion time complexity
O(1)
57
Hash Table average deletion time complexity
O(1)
58
Hash Table worst search time complexity
O(n)
59
Hash Table worst insertion time complexity
O(n)
60
Hash Table worst deletion time complexity
O(n)
61
Hash Table worst space time complexity
O(n)
62
Binary Search Tree average access time complexity
O(log(n))
63
Binary Search Tree average search time complexity
O(log(n))
64
Binary Search Tree average insertion time complexity
O(log(n))
65
Binary Search Tree average deletion time complexity
O(log(n))
66
Binary Search Tree worst access time complexity
O(n)
67
Binary Search Tree worst search time complexity
O(n)
68
Binary Search Tree worst insertion time complexity
O(n)
69
Binary Search Tree worst deletion time complexity
O(n)
70
Binary Search Tree worst space time complexity
O(n)
71
Cartesian Tree average search time complexity
O(log(n))
72
Cartesian Tree average insertion time complexity
O(log(n))
73
Cartesian Tree average deletion time complexity
O(log(n))
74
Cartesian Tree worst search time complexity
O(n)
75
Cartesian Tree worst insertion time complexity
O(n)
76
Cartesian Tree worst deletion time complexity
O(n)
77
Cartesian Tree worst space time complexity
O(n)
78
B-Tree average access time complexity
O(log(n))
79
B-Tree average search time complexity
O(log(n))
80
B-Tree average insertion time complexity
O(log(n))
81
B-Tree average deletion time complexity
O(log(n))
82
B-Tree worst access time complexity
O(log(n))
83
B-Tree worst search time complexity
O(log(n))
84
B-Tree worst insertion time complexity
O(log(n))
85
B-Tree worst deletion time complexity
O(log(n))
86
B-Tree worst space time complexity
O(n)
87
Red-Black Tree average access time complexity
O(log(n))
88
Red-Black Tree average search time complexity
O(log(n))
89
Red-Black Tree average insertion time complexity
O(log(n))
90
Red-Black Tree average deletion time complexity
O(log(n))
91
Red-Black Tree worst access time complexity
O(log(n))
92
Red-Black Tree worst search time complexity
O(log(n))
93
Red-Black Tree worst insertion time complexity
O(log(n))
94
Red-Black Tree worst deletion time complexity
O(log(n))
95
Red-Black Tree worst space time complexity
O(n)
96
Splay Tree average search time complexity
O(log(n))
97
Splay Tree average insertion time complexity
O(log(n))
98
Splay Tree average deletion time complexity
O(log(n))
99
Splay Tree worst search time complexity
O(log(n))
100
Splay Tree worst insertion time complexity
O(log(n))
101
Splay Tree worst deletion time complexity
O(log(n))
102
Splay Tree worst space time complexity
O(n)
103
AVL Tree average access time complexity
O(log(n))
104
AVL Tree average search time complexity
O(log(n))
105
AVL Tree average insertion time complexity
O(log(n))
106
AVL Tree average deletion time complexity
O(log(n))
107
AVL Tree worst access time complexity
O(log(n))
108
AVL Tree worst search time complexity
O(log(n))
109
AVL Tree worst insertion time complexity
O(log(n))
110
AVL Tree worst deletion time complexity
O(log(n))
111
AVL Tree worst space time complexity
O(n)
112
KD Tree average access time complexity
O(log(n))
113
KD Tree average search time complexity
O(log(n))
114
KD Tree average insertion time complexity
O(log(n))
115
KD Tree average deletion time complexity
O(log(n))
116
KD Tree worst access time complexity
O(n)
117
KD Tree worst search time complexity
O(n)
118
KD Tree worst insertion time complexity
O(n)
119
KD Tree worst deletion time complexity
O(n)
120
KD Tree worst space time complexity
O(n)
