The linked java test file, <a href="http://igm.univ-mlv.fr/~pivoteau/Timsort/Test.java" rel="nofollow">http://igm.univ-mlv.fr/~pivoteau/Timsort/Test.java</a> - still crashes the latest Java 10.0.2 with an 'Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 49'. Amazing! I wonder if this makes some web services vulnerable.. if the user can submit a just-so array of ints to be sorted? But it does seem like it would require uploading a really huge array (>4GB?)
How is it that the abstract is talking about "Java version" and "Python version" when discussing computational complexity? Aren't algorithms algorithms, independent of the language you're implementing them in?
Given that rho can vary with the input and is completely arbitrary value, shouldn’t be also called n?<p>Memories on the subject are not great so might be saying bullshit in here