From 4b55ba0f72e5669a797e9ed24cbc26a6880f3a1e Mon Sep 17 00:00:00 2001 From: Ramakrishnan Muthukrishnan <vu3rdd@gmail.com> Date: Fri, 9 Apr 2010 13:07:34 +0530 Subject: [PATCH] Added a note on finding the order of space. --- chapter1/ch1_2.clj | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/chapter1/ch1_2.clj b/chapter1/ch1_2.clj index 89ae7db..89ccec5 100644 --- 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] -- 2.45.2