| Rev | Time | Changes | Operations |
|---|
| Log |
|---|
| 23 | 2013-05-12 09:14:26 | +28 -0 line(s) | [View this version, source] [Diff to previous] |
| another solu~ |
| 22 | 2013-05-06 15:30:03 | +2 -0 line(s) | [View this version, source] [Diff to current|previous] |
| Add comment on wrong answer |
| 21 | 2013-04-28 23:46:07 | +8 -0 line(s) | [View this version, source] [Diff to current|previous] |
| ex1.3: 3 item only need compare twice |
| 20 | 2013-01-10 12:07:10 | +27 -0 line(s) | [View this version, source] [Diff to current|previous] |
| A simpler implementation using larger as a helper to compare two values
micky |
| 19 | 2013-01-08 13:41:00 | +0 -19 line(s) | [View this version, source] [Diff to current|previous] |
| delete wrong answer (e.g. a=b=c=1; a=b=1, c=2):
(define (sum-of-squared-largest-two a b c)
(+ (if (or (> a b) (> a c))
(* a a )
0)
(if (or (> b a) (> b c))
(* b b )
0)
(if (or (> c a) (> c b))
(* c c )
0))) |
| 18 | 2012-06-20 20:40:10 | +0 -13 line(s) | [View this version, source] [Diff to current|previous] |
| Don't work...
(define (square a)
(* a a))
(define (two-greatest-first? x y z)
(and (>= x z) (>= x y)))
(define (sum-of-greatest-squares x y z)
(if (two-greatest-first? x y z)
(+ (square x) (square y))
(sum-of-greatest-squares y z x))) |
| 17 | 2012-02-27 04:44:47 | +1 -1 line(s) | [View this version, source] [Diff to current|previous] |
| Useful expansions |
| 16 | 2012-02-27 04:38:54 | +15 -0 line(s) | [View this version, source] [Diff to current|previous] |
| I added a variation that hadn't been done yet |
| 15 | 2011-11-06 20:41:05 | +31 -0 line(s) | [View this version, source] [Diff to current|previous] |
| Added: Nov-6-2011 - Since the exercise was write **a** procedure, this adheres to that, perhaps a complex procedure would have been allowed (nested) but would have been perhaps hard to read.
Christian Boyd
christian.boyd@gmail.com |
| 14 | 2011-06-17 18:37:57 | +11 -0 line(s) | [View this version, source] [Diff to current|previous] |
| Uses no abstracted helper functions. |
| 13 | 2010-09-05 16:08:43 | +19 -0 line(s) | [View this version, source] [Diff to current|previous] |
| Another solution to this problem - not the most elegant, but it would be refactored to be nicer. ChrisWilson |
| 12 | 2010-07-21 07:10:03 | +3 -2 line(s) | [View this version, source] [Diff to current|previous] |
| simplify logic, there's no need to make one more evaluation |
| 11 | 2010-03-23 13:29:51 | +3 -3 line(s) | [View this version, source] [Diff to current|previous] |
| edited comments to show that my solution uses recursion |
| 10 | 2010-03-23 12:58:29 | +14 -0 line(s) | [View this version, source] [Diff to current|previous] |
| added my solution as well |
| 9 | 2010-03-08 22:25:01 | +1 -3 line(s) | [View this version, source] [Diff to current|previous] |
| Removed category; added link to solutions page |
| 8 | 2010-03-08 22:08:31 | +5 -0 line(s) | [View this version, source] [Diff to current|previous] |
| Added navigation and category |
| 7 | 2009-10-05 08:43:13 | +5 -0 line(s) | [View this version, source] [Diff to current|previous] |
| by truwater@gmail.com |
| 6 | 2009-08-29 19:43:34 | +10 -0 line(s) | [View this version, source] [Diff to current|previous] |
| using techniques up to only this point |
| 5 | 2009-07-17 20:26:49 | +12 -0 line(s) | [View this version, source] [Diff to current|previous] |
| Added another solution |
| 4 | 2009-07-05 16:13:40 | +1 -1 line(s) | [View this version, source] [Diff to current|previous] |
| fixed procedure name |
| 3 | 2009-07-05 16:10:10 | +15 -0 line(s) | [View this version, source] [Diff to current|previous] |
| added another method |
| 2 | 2009-01-22 01:26:03 | +22 -0 line(s) | [View this version, source] [Diff to current|previous] |
| added second solution |
| 1 | 2008-06-21 14:12:18 | +19 -0 line(s) | [View this version, source] [Diff to current|previous] |
| create solution page for SICP ex 1.3 |
| [Diff from epoch] |