14/1/2025
What I learned?
- Time Complexity
- Big O Notation
- Space Complexity
- Common Time Complexities
- Understanding O(1)
- Understanding O(n)
- Understanding O(n^2) & O(n^3)
- Understanding O(logn)
- O(nlogn)
- O(2^n) & O(n!)
- Solving for Prime Number
- Solving for Selection Sort
- Recursion (Time Complexity)
- Recursion (Space Complexity)
- Solving for Recursive Fibonacci
- Solving for Merge Sort
What I learned?
Exercise 1 - Pure HTML Media Player
Comments
Post a Comment