I am sure there are other more subtle ways to go about it but this seems about as fast as I can make it for a general brute-force solution (0.11s)
This one seems to work for the large test case, too, although it is not a general solution [for size(p,1)>100 it only tests corner points].
Find all elements less than 0 or greater than 10 and replace them with NaN
The Goldbach Conjecture, Part 2
Oh Zero Zero Zero!!!
Create an index-powered vector
Swap two numbers
Image Processing 004: Zernike Coefficients
ICFP2021 Hole-In-Wall: Solve Score=0, where number Hole Vertices = Figure Vertices
Compression: Encode and Decode
Vectorize the digits of an Integer
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