Pythagorean triples/Java/Brute force primitives: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

curprev 20:4520:45, 20 December 2011‎ rosettacode>Mwn3d‎ m 6,514 bytes +177‎ Somewhere in there I got rid of the need for 12 as a BigInteger, reformat
curprev 18:3918:39, 20 December 2011‎ rosettacode>Mwn3d‎ m 6,337 bytes +21‎ Forgot to update the output, remove runtime check
curprev 18:3718:37, 20 December 2011‎ rosettacode>Mwn3d‎ m 6,316 bytes −325‎ With the GCD check we can be sure that we have found a primitive, so we can mark them (negligible speed change)

curprev 16:5716:57, 19 December 2011‎ rosettacode>Mwn3d‎ m 6,641 bytes +52‎ It turns out that the GCD check can speed it up a little bit

curprev 18:3018:30, 14 December 2011‎ rosettacode>Mwn3d‎ 6,589 bytes −110‎ This is what I was really looking for when I made that last optimization
curprev 16:1416:14, 14 December 2011‎ rosettacode>Mwn3d‎ 6,699 bytes +463‎ Another slight speedup

curprev 21:3121:31, 16 November 2011‎ rosettacode>Mwn3d‎ m 6,236 bytes 0‎ Don't have to scale by 1. Negligible effect on the run time.
curprev 19:5419:54, 16 November 2011‎ rosettacode>Mwn3d‎ m 6,236 bytes −9‎ Save another operation (this way might do the same thing under the hood)
curprev 19:4519:45, 16 November 2011‎ rosettacode>Mwn3d‎ m 6,245 bytes 0‎ Possibly saving one addition every once in a while

curprev 01:4801:48, 12 August 2011‎ rosettacode>Mwn3d‎ 6,245 bytes +1‎ When I said "very very slight speedup" I was only looking at the perimeter < 1000 results. It actually makes a huge difference.

curprev 15:2215:22, 11 August 2011‎ rosettacode>Mwn3d‎ m 6,244 bytes +89‎ a*b = 0 (mod 12) for all triples, very very slight speedup, checking that a*b*c = 0 (mod 60) actually slowed it down

curprev 18:3218:32, 15 July 2011‎ rosettacode>Mwn3d‎ m 6,155 bytes −2‎ Moved the LIMIT declaration but forgot to take the comment with it
curprev 18:1318:13, 15 July 2011‎ rosettacode>Mwn3d‎ 6,157 bytes +346‎ Fursther optimization by skipping more a,b pair candidates (noted in the comments), rm runtime calculations
curprev 17:2817:28, 15 July 2011‎ rosettacode>Mwn3d‎ m 5,811 bytes +111‎ Incredibly slight optimization (took the runtime of a 10k perimeter limit from 90 seconds to 89 seconds on this computer)
curprev 17:0717:07, 15 July 2011‎ rosettacode>Mwn3d‎ m 5,700 bytes +484‎ Extra notes and comments, move a comparison so it is only calculated if needed.

curprev 22:3822:38, 14 July 2011‎ rosettacode>Mwn3d‎ m 5,216 bytes +36‎ Notes about the Triple class, also THREE and FOUR were never used
curprev 22:3122:31, 14 July 2011‎ rosettacode>Mwn3d‎ 5,180 bytes +5,180‎ A version that uses brute force to find primitives

20 December 2011

19 December 2011

14 December 2011

16 November 2011

12 August 2011

11 August 2011

15 July 2011

14 July 2011