Added a note on finding the order of space.

diff --git a/chapter1/ch1_2.clj b/chapter1/ch1_2.clj
index 89ae7db1d713e00e29488d7f8fff2363f134b019..89ccec5724b40e08704d0f3677d3beed4d5977c8 100644 (file)
--- a/chapter1/ch1_2.clj
+++ b/chapter1/ch1_2.clj
@@ -448,6 +448,10 @@ TRACE t2494: => -0.39980345741334
 ;;   a * (1/3)^n <= 0.1
 ;;   => take log to the base 3 on both the sides.
 
+;; Note: Finding the order of space in a recursive process is sort of, equiv
+;;       to finding the number of deferred operations. Which is in-turn the
+;;       same as the depth of the evaluation tree.
+
 ;; 1.2.4: exponentiation
 ;; computing b^n
 (defn expt [b n]