## Version 1.0.0

This subroutine takes an $m$ by $n$ sparse matrix $A$, whose entries are stored by rows, and reorders it to be stored by columns. The subroutine diﬀers from MC38 inasmuch as it requires less storage but may be slower, particularly on vector machines.