Big O Notation Flashcards
1
Q
linear search best case time complexity
A
O(1)
2
Q
linear search average case time complexity
A
O(n)
3
Q
linear search worst case time complexity
A
O(n)
4
Q
Binary search array best case time complexity
A
O(1)
5
Q
Binary search array average case time complexity
A
O(log n)
6
Q
Binary search array worst case time complexity
A
O(log n)
7
Q
Binary search tree best case time complexity
A
O(1)
8
Q
Binary search tree average case time complexity
A
O(log n)
9
Q
Binary search tree worst case time complexity
A
O(n)
10
Q
Hashing best case time complexity
A
O(1)
11
Q
Hashing average case time complexity
A
O(1)
12
Q
Hashing worst case time complexity
A
O(n)
13
Q
Breadth/depth-first of graph best case time complexity
A
O(1)
14
Q
Breadth/depth-first of graph average case time complexity
A
O(V+E)
15
Q
Breadth/depth-first of graph worst case time complexity
A
O(V^2)
