1. This solution is much faster on re-invocation than the one without the persistent num_ones variable. Unless of course it is performed on a much larger (than num_ones) array of 32-bit integer.
2. It is essential to have the statement
The reason for this is that the floor() function has a problem with precision. If can fail with 32-bit integer that are close to 2^32.
For instance, consider this Matlab code and system response:
The Goldbach Conjecture, Part 2
Count from 0 to N^M in base N.
Number of 1s in a binary string
Reindex a vector
Avalaible area: wall construction
Spherical radius given four points
Mastermind II: Solve in 8 or less
Criss-Cross: NHL - Optimize Matrix Size
Knot Count - Speed
Rubik's Cube: 30 Moves or Less : Cody Size
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