You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: lessons/space-complexity.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line number
Diff line number
Diff line change
@@ -14,7 +14,7 @@ It is a way to establish approximate relationship between size of input data and
14
14
15
15
Calculation of space complexity used to hold much more significance in early days of computing than it does now. This is because most machines today have large memories and the user does not need to worry about running out of memory for running a program or two. But it is a crucial estimate where the physical memory is limited or closely monitored.
16
16
17
-
###**Calculation of Space Complexity**
17
+
## **Calculation of Space Complexity**
18
18
19
19
An algorithm's space can be categorized into 2 parts:\
20
20
**1)Fixed Part** which is independent of characteristics of input and output.\
@@ -51,7 +51,7 @@ In this case there are 3 statements (1 if & 2 return statements). The depth of r
51
51
***NOTE: Space complexity might differ from machine to machine based on the programming language, the compiler etc.***
0 commit comments