From 5a31469c4ad627adff595c2f024b7e3d711f5f69 Mon Sep 17 00:00:00 2001
From: jim
Date: Tue, 24 Feb 2015 18:39:41 -0500
Subject: [PATCH] probably most efficient
---
exercises/assignment3_answers.mdwn | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/exercises/assignment3_answers.mdwn b/exercises/assignment3_answers.mdwn
index 92da0884..0db7c266 100644
--- a/exercises/assignment3_answers.mdwn
+++ b/exercises/assignment3_answers.mdwn
@@ -57,7 +57,7 @@
> I'm not sure which of the two solutions presented here is better. The one given in the hint traverses the list only once; whereas the one gotten by reversing the list and getting the last member of the result traverses the list twice. But the former strategy does more complicated stuff at each step of the traversal (both conceptually and more applications), so in the end it might be computationally "cheaper" to use the latter strategy.
- > Here is yet a third solution:
+ > Here is yet a third solution, which is probably the most efficient:
> let box = \a. \v. v a in
> let left_head = \xs. xs (\b x. (K (b (K x)))) (box err) I in
--
2.11.0