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.
927 Solvers
284 Solvers
Return the first and last characters of a character array
3480 Solvers
2106 Solvers
Find the next Fibonacci number
223 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!