Big Os Search Flashcards
1
Q
BAWlinear
A
B= o(1)
A=o(n)
W=o(n)
2
Q
BAW binary search
A
B= o(1)
A=o(log n)
W=o(log n)
3
Q
BAW binary tree
A
B = o(1)
A =o(log n)
W=o(n)
4
Q
BAW HASHING
A
B = o(1)
A= o(1)
W= o(n)
5
Q
BAW breadth depth
A
B= o(1)
A= o(V+E)
W=o(v^2)
