From b4cb2d9a1499f826d58d8fb3b7265a5eec4eb46f Mon Sep 17 00:00:00 2001
From: Jim Pryor
Date: Sun, 3 Oct 2010 13:25:40 -0400
Subject: [PATCH] assignment3 naming fussing
Signed-off-by: Jim Pryor
---
assignment3.mdwn | 14 +++++---------
1 file changed, 5 insertions(+), 9 deletions(-)
diff --git a/assignment3.mdwn b/assignment3.mdwn
index 8ea5777c..c4d99927 100644
--- a/assignment3.mdwn
+++ b/assignment3.mdwn
@@ -51,19 +51,15 @@ Then `length mylist` evaluates to 3.
function, write a function that computes factorials. (Recall that n!,
the factorial of n, is n times the factorial of n-1.)
-Warning: my browser isn't able to compute factorials of numbers
-greater than 2 (it does't provide enough resources for the JavaScript
-interpreter; web pages are not supposed to be that computationally
-intensive).
+Warning: it takes a long time for my browser to compute factorials larger than 4!
-3. (Easy) Write a function `listLenEq` that returns true just in case
-two lists have the
-same length. That is,
+3. (Easy) Write a function `equal_length` that returns true just in case
+two lists have the same length. That is,
- listLenEq mylist (make_list junk (make_list junk (make_list junk empty)))
+ equal_length mylist (make_list junk (make_list junk (make_list junk empty)))
~~> true
- listLenEq mylist (make_list junk (make_list junk empty))) ~~> false
+ equal_length mylist (make_list junk (make_list junk empty))) ~~> false
4. (Still easy) Now write the same function, but don't use the length
--
2.11.0