From 3ed508aa627b89b62239723c3f20a971d8f5aed1 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Sun, 3 Oct 2010 13:28:31 -0400 Subject: [PATCH] assignment3 tweak Signed-off-by: Jim Pryor --- assignment3.mdwn | 9 ++++++--- 1 file changed, 6 insertions(+), 3 deletions(-) diff --git a/assignment3.mdwn b/assignment3.mdwn index 50495f52..8c22dfa4 100644 --- a/assignment3.mdwn +++ b/assignment3.mdwn @@ -51,7 +51,7 @@ 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: it takes a long time for my browser to compute factorials larger than 4! + Warning: it takes a long time for my browser to compute factorials larger than 4! 3. (Easy) Write a function `equal_length` that returns true just in case two lists have the same length. That is, @@ -108,7 +108,8 @@ whether the length of the list is less than or equal to 1. This will be your base case for your recursive functions that operate on these trees. -1. Write a function that sums the number of leaves in a tree. +
    +
  1. Write a function that sums the number of leaves in a tree. Expected behavior: @@ -131,5 +132,7 @@ Expected behavior: sum-leaves tc ~~> 6 -2. Write a function that counts the number of leaves. +
  2. Write a function that counts the number of leaves. + +
-- 2.11.0