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].
Create a square matrix of multiples
middleAsColumn: Return all but first and last element as a column vector
Implement a bubble sort technique and output the number of swaps required
Three...is a magic number.
Sum the 'edge' values of a matrix
DNA Pattern Match: Performance Metric - Speed
Criss-Cross Verification: NHL
GJam 2014 Rd 1c: Reordering Train Cars (Large)
PACMAT 08 - Awesome Tunneling Ghosts, 2X Speed, 6 Lives, Game Download
Chezz_015 : Simplified chess
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