Fixed for the next release. It appears that during a sort, each discovered row was not able to move an entry before the current row pointer if the row was determined to have a lower value than the current row. This resulted in the lower item being placed in the current position, with the sort restarting from the value of the lower item. Changed the sort algorithm to use a middle-out approach and it appears to have resolved the issue against the provided test.