Vincent Jugé added the comment:
After having worked a little bit on improving AdaptiveShiversSort on few-run
cases, I designed a new version of the algorithm, called shivers2 in the file
runstack.py joined to this message
It looks more complicated than the original AdaptiveShiversSort
Vincent Jugé added the comment:
I see... Indeed, my only goal when adapting Shivers Sort was to maintain some
invariant that would make the analysis easy, while mimicking the arguments
developed by Buss & Knop for their analysis of (plain) Shivers Sort. It is,
however, sure that the n
Vincent Jugé added the comment:
Dear all,
After me and my colleagues worked on the first paper you mention, I recently
created another merge-based sorting algorithm, which I called "Adaptive Shivers
Sort". This is a close variant of the Augmented Shivers Sort presented by Bu
