Performance tips for a function which finds n maximums in a matrix

[JM_Beckers]

Or you adapt this one to get the maxima instead of minima, which is very efficient for small n.

Find n smallest values in an n dims array

I think this version is not optimal if n is very small compared to the size of the array since you make a full sort and just retain a few smallest values. At the limit, imagine to get the lowest value of an array you make a sort first. That does not sound right. A dirty write-up like the following using BenchmarkTools A=rand(100,100,10,40,10); function arg_n_smallest_values(A::AbstractArray{T,N}, n::Integer) where {T,N} perm = sortperm(vec(A)) ci = CartesianIndices(A) …