No, there is no faster version. We discussed this already in one of your previous questions where you were asking about max(). As I said then in https://www.mathworks.com/matlabcentral/answers/397675-is-there-a-faster-version-of-min#comment_561596
"If you break out the timing, you will likely find that the cost is in extracting the sub-array c(1,d) to send to the min() function. min() is at worst a linear operation (I say at worst because in theory it could be run in parallel for sufficiently large arrays.)"
If you calculate
>> 9925.39/14867689025
ans =
6.6758122148711e-07
You can see that it is taking about 6.6E-7 seconds per iteration. That is twice as fast as just making one anonymous function call:
>> timeit(@() fun(),0)
ans =
1.441973e-06
so that is really pretty efficient; the Just In Time compiler must be doing a really good job with it.
