This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author vincent.juge
Recipients koos.zevenhoven, tim.peters, vincent.juge, xtreak
Date 2018-09-22.08:23:08
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <>
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(H+4) upper bound I get should be refined when H is small, which more or less amounts to tackling the 3-run case you mention.

I am reasonably convinced that the current version of Adaptive Shivers Sort could be adapted to take this problem into account, while keeping its overall simple stricture and complexity analysis.

If this first step turns out to be feasible, I will also look at the latest version of to investigate other possible improvements on Adaptive Shivers Sort.
Date User Action Args
2018-09-22 08:23:08vincent.jugesetrecipients: + vincent.juge, tim.peters, koos.zevenhoven, xtreak
2018-09-22 08:23:08vincent.jugesetmessageid: <>
2018-09-22 08:23:08vincent.jugelinkissue34561 messages
2018-09-22 08:23:08vincent.jugecreate