Question re N ≥ M #6
Description
The paper http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf mentions that N ≥ M. I haven't read it all. This library doesn't seem to reorder arguments such that one is always greater than or equal to the other in length. Would that be a performance optimization or is the algorithm symetric and that invariant just there for explaining the O(time) complexity?