Adaptive ShiversSort - A new sorting algorithm (Vincent Jugé)

I will present a sorting algorithm called adaptive ShiversSort. This recently
developed algorithm improves the speed at which it sorts arrays by using
the existence of already sorted subarrays. I will focus on the links between
this algorithm and the algorithm TimSort, which is a standard algorithm in
Python and Java. I will also show that the complexity of adaptive ShiversSort,
in terms of comparisons performed, is optimal up to an additive linear factor.