Solution 11 by Alfonso crushes Java performance with a time of 0.014s for 1000!. Best use of base.
longer code but considerably faster non-java solution (0.05s for 1000!)
Solution 9 sees Alfonso step up and provide a concise method in the Best Factorial Solution in the Non-Java Category.
We don't need no steenkin' Java. :-)
Solution 6 is an expertly crafted non-java solution. Complexity Level- Outstanding. Time for 1000! vs Java ?
The convolution method is considerably slower than Java, which is what you would expect. For the java vs. non-java solutions:
Java - Elapsed time is 0.138064 seconds.
This case - Elapsed time is 1.039240 seconds.
Return the 3n+1 sequence for n
6217 Solvers
842 Solvers
1316 Solvers
Numbers with prime factors 2, 3 and 5.
173 Solvers
How many monitors are connected ?
129 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!