Online course - Data structure
Data structure - William Fiset from google
Related resources
Learning Notes
03. Introduction to Big-O
Big-O Notation gives an upper bound of the complexity in the worst case, helping to quantify performance as the input size becomes arbitrarily large.
- Constant time cases O(1)
i = 0
while i<11 do
i = i + 1
- Linear time cases O(n)
