Big O Notation
The Big O Notation is a mathematical, asymptotic notation that describes time complexity and space complexity of algorithms/ function when the argument tends...
Recent Posts
Memory
Key Terms
Data Structures Compendium
Data structures can be seen as instrumental tools used to address a wide array of problems. They frequently encompass complex and mathematical concepts and c...
Complexity Analysis
It’s a process in which we determine how efficient an algorithm is. There are multiple ways to solve the same issue but the complexity analysis will likely d...
How to think and approach refactoring?
Introduce