Fix algorithmic complexity of lazy sorting; initial non-Floyd's-algorithm heap insertion makes it O(n log n) at least.