In this video we talk about Big O notation in computer science to get the worst case complexity of an algorithm.
We talk about the usecase, how to calculate and examples to calculate the complexity.
Timestamps:
0:00 Introduction to Big O notation
4:47 O(1)
6:28 O(N)
7:16 O(2^N)
9:38 O(log N)
11:25 O(A+B) & O(A*B)
12:27 Comparison of complexities
13:33 Thanks
