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.
Project Euler: Problem 1, Multiples of 3 and 5
Convert String to Morse Code
Flip the main diagonal of a matrix
What's Your BMI?
Make a diamond
TRON Tourney 000 : Clockwise Wall Hugger
Knots Contest: Minimum Knots (ContestSuite)
Create formatted value string Cell array of a vector
Criss_Cross_010 : Unique elements, Square array, Words in one array
GJam March 2016 IOW: Polynesiaglot Small
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office