if you think about it, the row-comparing algo basically boils down to a sum of differences. As summation is independent of the order of its terms, it can be don

if you think about it, the row-comparing algo basically boils down to a sum of differences. As summation is independent of the order of its terms, it can be done in arbitrary order, and thus the (orthogonal) shuffling makes no difference.