Most efficient method to query a Young Tableau
- by Matthieu M.
A Young Tableau is a 2D matrix A of dimensions M*N such that:
i,j in [0,M)x[0,N):
for each p in (i,M), A[i,j] <= A[p,j]
for each q in (j,N), A[i,j] <= A[i,q]
That is, it's sorted row-wise and column-wise. Since it may contain less than M*N numbers, the bottom-right values might be represented either as missing or using (in algorithm…
