1
Q
Vector insertion speed
A
o(1)
2
Q
Vector remove speed
A
o(n)
3
Q
Vector find speed
A
o(n)
4
Q
vector sort speed
A
O(nlogn)
5
Q
linked list sort speed
A
O(nlogn)
6
Q
linked list find speed
A
O(n)
7
Q
linked list remove speed
A
O(n)
8
Q
linked list insert speed
A
O(1)
9
Q
Binary search Insert
A
O(n)
10
Q
Binary search remove
A
O(n)
11
Q
Binary search find
A
logn
12
Q
binary search sort
A
O(1)
13
Q
Hash table insert
A
O(1)
14
Q
Hash table remove
A
O(1)
15
Q
Hash table find
A
O(1)
16
Q
Hash table sort
A
O(nlogn)
17
Q
balanced binary sort insert
A
O(logn) if balanced
18
Q
BST remove
A
O nlogn if balanced
CPSC
flashcards
Decks in class (14)
# Cards
