Tag: big O

2 articles
big o notation

Big (O) Notation Explanation

17 min read

The Big(O) Notation is a fundamental concept to help us measure the time complexity and space complexity of the algorithm. In other words, it helps us measure how performant and how much storage and computer resources an algorithm uses. Also, in any...

Mastering Programming Recursion with Java

6 min read

Recursion is a programming fundamental that is highly used in algorithms. Simply put, recursion is the ability of a method to call itself. When a method calls itself it stacks up and uses the LIFO (Last-in First-out) approach. It’s the same...

Menu