Before revision:  Detailed and reproducible numerical experiments demonstrate the effectiveness of our algorithm, showing that in practice MISTR enjoys O k^2\log{k} average-case time complexity , nearly linear in the size of the input . This represents a substantial improvement over existing one-dimensional algorithms .
After revision:  Detailed and reproducible numerical experiments demonstrate the effectiveness of our algorithm, showing that in practice MISTR enjoys O k^2\log{k} average-case time complexity , nearly linear in the size of the input .