I've tried multiple schemes, some are faster than histc, but not fast enough. Hint?
This is nearly 30% slower than Solution 772002(size 35) on my PC(win 10 pro x64,i7 4700mq)
Hi Alfonso, I noticed that a faster solution is often beat by a slower solution (according to my own computer) when running on Cody. Could you share your knowledge or some guess on this issue? Thanks.
Split a string into chunks of specified length
Determine if input is a perfect number
Detect a number and replace with two NaN's
Magic is simple (for beginners)
Fast 1-D Convolution (full shape)
Moving Product (Easy)
Fast 1-D Convolution (same shape)
0, 2, 0, -2, 0, 2, 0, -2, ...
The Top 5 Primes
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