Revisions to Project Euler #3 in Java

replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/

Source Link

edited Apr 13, 2017 at 12:40

Community Bot

1

This algorithm is a slightly optimized version of Martin R's answer Martin R's answer.

OP's algorithm OP's algorithm:

h.j.k.'s algorithm h.j.k.'s algorithm:

JS1's algorithm JS1's algorithm:

thepace's algorithm thepace's algorithm is currently a WIP.

Credit must go to Martin R Martin R for the original solution.

deleted 289 characters in body

Source Link

edited Dec 28, 2014 at 12:08

wei2912

1.3k
8
26

Alnitak's algorithm:

Algorithm: Alnitak's algorithm
Time required to calculate in nanoseconds: 47100

My algorithm:

Algorithm: wei2912's algorithm
Time required to calculate in nanoseconds: 46488

From thepace's algorithm onwards, the benchmarks run too fast to be effective. Using a 1000 trials:

Algorithm: wei2912's algorithm
Average time per trial (ns): 1453715507
Algorithm: Alnitak's algorithm
Average time per trial (ns): 1030910880

Algorithm: wei2912's algorithm
Average time per trial (ns): 12073
Algorithm: Alnitak's algorithm
Average time per trial (ns): 8602

Algorithm: wei2912's algorithm Average time per trial (ns): 12337 Algorithm: Alnitak's algorithm Average time per trial (ns): 7661

Alnitak's algorithm appears to be nearly 2 times faster. Great job to Alnitak! :)

Alnitak's algorithm:

Algorithm: Alnitak's algorithm
Time required to calculate in nanoseconds: 47100

My algorithm:

Algorithm: wei2912's algorithm
Time required to calculate in nanoseconds: 46488

From thepace's algorithm onwards, the benchmarks run too fast to be effective. Using a 1000 trials:

Algorithm: wei2912's algorithm
Average time per trial (ns): 14537
Algorithm: Alnitak's algorithm
Average time per trial (ns): 10309

Algorithm: wei2912's algorithm
Average time per trial (ns): 12073
Algorithm: Alnitak's algorithm
Average time per trial (ns): 8602

Alnitak's algorithm appears to be 2 times faster. Great job to Alnitak! :)

From thepace's algorithm onwards, the benchmarks run too fast to be effective. Using 1000 trials:

Algorithm: wei2912's algorithm
Average time per trial (ns): 15507
Algorithm: Alnitak's algorithm
Average time per trial (ns): 10880

Algorithm: wei2912's algorithm Average time per trial (ns): 12337 Algorithm: Alnitak's algorithm Average time per trial (ns): 7661

Alnitak's algorithm appears to be nearly 2 times faster. Great job to Alnitak! :)

added 171 characters in body

Source Link

edited Dec 28, 2014 at 8:17

wei2912

1.3k
8
26

Alnitak's algorithm also needs to be corrected.:

Algorithm: Alnitak's algorithm
Time required to calculate in nanoseconds: 47100

ResultAlgorithm: 6857wei2912's algorithm
Time required to calculate in nanoseconds: 10775546488

From thepace's algorithm onwards, the algorithmsbenchmarks run too fast to be used as benchmarkseffective. Using a 1000 trials:

Algorithm: wei2912's algorithm
Average time per trial (ns): 14537
Algorithm: Alnitak's algorithm
Average time per trial (ns): 10309

Looks like Alnitak's algorithm is faster.

Generating a million random ints and feeding them into my algorithmin:

Algorithm: wei2912's algorithm
Average time per trial (ns): 1528712073
Algorithm: Alnitak's algorithm
Average time per trial (ns): 8602

Alnitak's algorithm appears to be 2 times faster. Great job to Alnitak! :)

I'd be glad to accept any suggestions for benchmarks.

Alnitak's algorithm also needs to be corrected.

Result: 6857
Time required to calculate in nanoseconds: 107755

From thepace's algorithm onwards, the algorithms run too fast to be used as benchmarks.

Generating a million random ints and feeding them into my algorithm:

Algorithm: wei2912's algorithm
Average time per trial (ns): 15287

Alnitak's algorithm:

Algorithm: Alnitak's algorithm
Time required to calculate in nanoseconds: 47100

Algorithm: wei2912's algorithm
Time required to calculate in nanoseconds: 46488

From thepace's algorithm onwards, the benchmarks run too fast to be effective. Using a 1000 trials:

Algorithm: wei2912's algorithm
Average time per trial (ns): 14537
Algorithm: Alnitak's algorithm
Average time per trial (ns): 10309

Looks like Alnitak's algorithm is faster.

Generating a million random ints and feeding them in:

Algorithm: wei2912's algorithm
Average time per trial (ns): 12073
Algorithm: Alnitak's algorithm
Average time per trial (ns): 8602

Alnitak's algorithm appears to be 2 times faster. Great job to Alnitak! :)

I'd be glad to accept any suggestions for benchmarks.

Remove benchmarks as the other 2 fast algorithms are found to have an error in them.

Source Link

edited Dec 25, 2014 at 13:30

wei2912

1.3k
8
26

Loading

Add Altinak's algorithm benchmarks.

Source Link

edited Dec 24, 2014 at 18:51

wei2912

1.3k
8
26

Loading

Fix a few typos.

Source Link

edited Dec 24, 2014 at 14:10

wei2912

1.3k
8
26

Loading

Throw in a further optimization.

Source Link

edited Dec 24, 2014 at 6:56

wei2912

1.3k
8
26

Loading

Clear up a few holes in the explanation.

Source Link

edited Dec 23, 2014 at 18:29

wei2912

1.3k
8
26

Loading

Fix slight typo and grant community wiki.; Post Made Community Wiki

Source Link

edited Dec 23, 2014 at 18:02

wei2912

1.3k
8
26

Loading

Optimize Haskell solution.

Source Link

edited Dec 23, 2014 at 17:50

wei2912

1.3k
8
26

Loading

Fix mistake in trace.

Source Link

edited Dec 23, 2014 at 17:42

wei2912

1.3k
8
26

Loading

Add in benchmarks of all algorithms posted in this question.

Source Link

edited Dec 23, 2014 at 17:33

wei2912

1.3k
8
26

Loading

Update haskell version.

Source Link

edited Dec 23, 2014 at 16:38

wei2912

1.3k
8
26

Loading

added 3 characters in body

Source Link

edited Dec 23, 2014 at 16:16

wei2912

1.3k
8
26

Loading

Fix a typo.

Source Link

edited Dec 23, 2014 at 16:00

wei2912

1.3k
8
26

Loading

add very informal benchmark

Source Link

edited Dec 23, 2014 at 6:16

wei2912

1.3k
8
26

Loading

Source Link

answered Dec 23, 2014 at 6:10

wei2912

1.3k
8
26

Loading

Stack Exchange Network

Return to Answer