# Edit History

## Edit history of sicp-ex-1.3

RevTimeChangesOperations
Log
452015-04-09 09:52:16+10 -0 line(s)[View this version, source] [Diff to previous]
Add another answer
442015-02-02 04:47:47+32 -0 line(s)[View this version, source] [Diff to current|previous]
Example using sorting networks
432015-01-01 12:27:42+10 -0 line(s)[View this version, source] [Diff to current|previous]
Different approach, where square of the lowest term is deducted.
422014-11-11 23:28:38+11 -0 line(s)[View this version, source] [Diff to current|previous]
Added Solution
412014-10-05 11:43:47+5 -3 line(s)[View this version, source] [Diff to current|previous]
Better formatting for entry with function name "sum".
402014-10-05 11:41:00+11 -0 line(s)[View this version, source] [Diff to current|previous]
Added a solution without helper functions. Similar to sum-max2-sqr, but more concise.
392014-09-07 04:17:53+0 -8 line(s)[View this version, source] [Diff to current|previous]
Removed because same solution
382014-08-02 19:43:27+1 -1 line(s)[View this version, source] [Diff to current|previous]
Bug fixes
372014-08-02 19:11:42+8 -0 line(s)[View this version, source] [Diff to current|previous]
arithmetic version of sum-max2 squares
362014-08-02 18:49:08+1 -1 line(s)[View this version, source] [Diff to current|previous]
fixed bug in sum-sq-max2
352014-08-02 18:47:01+17 -0 line(s)[View this version, source] [Diff to current|previous]
Short version of sum of squares using cond
342014-07-20 03:18:28+1 -0 line(s)[View this version, source] [Diff to current|previous]
Add comment on wrong answer
332014-05-20 16:50:08+15 -0 line(s)[View this version, source] [Diff to current|previous]
simple solution.
322014-04-24 11:17:35+8 -0 line(s)[View this version, source] [Diff to current|previous]
added a solution
312014-04-14 13:36:27+15 -0 line(s)[View this version, source] [Diff to current|previous]
different Ex 1.3 solution
302014-01-26 08:23:49+1 -1 line(s)[View this version, source] [Diff to current|previous]
Comment last program
292013-12-23 18:07:31+0 -14 line(s)[View this version, source] [Diff to current|previous]
282013-10-15 14:20:05+16 -0 line(s)[View this version, source] [Diff to current|previous]
another solution added (tag: make it clearly)
272013-08-16 17:06:01+2 -0 line(s)[View this version, source] [Diff to current|previous]
point out a error in one of the submitted codes How Si Wei
262013-07-23 03:07:50+29 -0 line(s)[View this version, source] [Diff to current|previous]
eugenek
252013-06-19 23:59:45+1 -1 line(s)[View this version, source] [Diff to current|previous]
Removed unneeded parenthesis around consequent variable x in if combination.
242013-06-19 23:25:34+20 -0 line(s)[View this version, source] [Diff to current|previous]
;; no min used (define (square x) (* x x)) (define (sum-of-squares x y) (+ (square x) (square y))) (define (biggest x y) (if (> x y) (x) y)) (define (input x y z) (sum-of-squares (biggest x y) (biggest y z)))
232013-05-12 09:14:26+28 -0 line(s)[View this version, source] [Diff to current|previous]
another solu~
222013-05-06 15:30:03+2 -0 line(s)[View this version, source] [Diff to current|previous]
Add comment on wrong answer
212013-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
202013-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
192013-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)))
182012-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)))
172012-02-27 04:44:47+1 -1 line(s)[View this version, source] [Diff to current|previous]
Useful expansions
162012-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
152011-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
142011-06-17 18:37:57+11 -0 line(s)[View this version, source] [Diff to current|previous]
Uses no abstracted helper functions.
132010-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
122010-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
112010-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
102010-03-23 12:58:29+14 -0 line(s)[View this version, source] [Diff to current|previous]
added my solution as well
92010-03-08 22:25:01+1 -3 line(s)[View this version, source] [Diff to current|previous]
Removed category; added link to solutions page
82010-03-08 22:08:31+5 -0 line(s)[View this version, source] [Diff to current|previous]
Added navigation and category
72009-10-05 08:43:13+5 -0 line(s)[View this version, source] [Diff to current|previous]
by truwater@gmail.com
62009-08-29 19:43:34+10 -0 line(s)[View this version, source] [Diff to current|previous]
using techniques up to only this point
52009-07-17 20:26:49+12 -0 line(s)[View this version, source] [Diff to current|previous]
Added another solution
42009-07-05 16:13:40+1 -1 line(s)[View this version, source] [Diff to current|previous]
fixed procedure name
32009-07-05 16:10:10+15 -0 line(s)[View this version, source] [Diff to current|previous]
added another method
22009-01-22 01:26:03+22 -0 line(s)[View this version, source] [Diff to current|previous]
added second solution
12008-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]