| Rev | Time | Changes | Operations |
|---|
| Log |
|---|
| 9 | 2012-09-25 09:53:45 | +23 -0 line(s) | [View this version, source] [Diff to previous] |
| Add O(n^2) solution. |
| 8 | 2012-05-11 12:53:52 | +1 -1 line(s) | [View this version, source] [Diff to current|previous] |
| in original algorithm:
(ordered-triples-sum 5 7) we get (4 1 2) (4 2 1) (5 1 1)
"4,1,2" duplicates |
| 7 | 2010-04-19 12:34:29 | +16 -15 line(s) | [View this version, source] [Diff to current|previous] |
| move comments down |
| 6 | 2010-04-06 14:10:34 | +6 -2 line(s) | [View this version, source] [Diff to current|previous] |
| add: nav |
| 5 | 2010-03-28 05:36:43 | +1 -1 line(s) | [View this version, source] [Diff to current|previous] |
| Fixed order in '(n,k)-tuple' |
| 4 | 2010-03-28 04:03:11 | +76 -1 line(s) | [View this version, source] [Diff to current|previous] |
| Yet another solution and generalization. |
| 3 | 2010-03-25 21:46:30 | +36 -0 line(s) | [View this version, source] [Diff to current|previous] |
| Added another solution. |
| 2 | 2009-06-22 02:39:24 | +17 -1 line(s) | [View this version, source] [Diff to current|previous] |
| Added concise solution to end of file and comments on the previous work.
Nathan TeGrotenhuis |
| 1 | 2007-12-30 04:32:33 | +112 -0 line(s) | [View this version, source] [Diff to current|previous] |
| initial brutal draft |
| [Diff from epoch] |