Forgive me if I missed any replies. Since I have seen none, I will rephrase the request.
Please demonstrate an irregular array in numpy with time complexity measurement. The shape does not matter so long as it is non-rectangular and includes a complexity measurement. A sparse matrix is conceptually rectangular, so it does not fit the request at all.
The question is whether numpy has such support; if not, is it planned.
No, and no.