Time & Space Complexity – III

In the previous post I talked about time complexity of simple for loops. In the previous post, I talked about the time and space complexity of simple for loops. I hope you got the time and space complexity of the algorithm with 3 for loops as O(n^3) and O(n^2) respectively. Let’s discuss some more examples,

Read More


Time & Space Complexity – II

Click here to go to the previous post. While calculating the space complexity of the algorithm, we established that one variable would take one unit of space. Space Complexity of Algorithm 2 Click here to view Algorithm 2. The easiest way to calculate the space complexity is to list out the variables and add 1

Read More


Time & Space Complexity – I

In simple words, time complexity is the amount of an algorithm takes to execute, and the space complexity is the memory used. In general, if you have ever studied the time and space complexity of algorithms, the one thing that we remember is: for loops are bad. In this first part of the series of

Read More