I think this is (so far) the most efficient solution for large m. It requires at most log(4*m)/log(5) iterations; while the smaller sized solutions that have been suggested require at least 0.8*m iterations (or a very large array). For example, for m = 10^5, this solution takes at most 8 iterations while the other solutions of smaller size require at least 80,000 iterations.
Return a list sorted by number of occurrences
Given two strings, find the maximum overlap
Make one big string out of two smaller strings
Max index of 3D array
Sum the 'edge' values of a matrix
Make a rainbow matrix (follow-up to checkerboard matrix)
Number of even divisors of a given number
Equal temperament - musical notes and frequency
Number of paths on a n-dimensional grid
Fractal: area and perimeter of Koch snowflake
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