Very elegant method to generate and utilize created optimal scores from the left. This solution is very fast and nearly linear with size.
It is not close to linear. Richard, since he is using the function max for every number. It is at least O(n^2), in which n is size, and maybe even a little bit more since he is using indexing, another comparison(besides max), creating new arrays and so on. His code is small and functional though: kudos.
The Goldbach Conjecture, Part 2
Implement a ROT13 cipher
CONVERT TAN TO SIN
Sum of series I
PONG 002: Rectangle, Interactive Download, Easier Play
Knots Contest: Score (TestSuite)
QWERTY Shift Code Decoder
Rubik's Cube: 30 Moves or Less : Contest Scoring (Time/Size/Moves)
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