Adaptive Shivers Sort: An Alternative Sorting Algorithm

09/22/2018
by   Vincent Jugé, et al.
0

We present a stable mergesort, called , that exploits the existence of monotonic runs for sorting efficiently partially sorted data. We also prove that, although this algorithm is simple to implement, its computational cost, in number of comparisons performed, is optimal up to an additive linear term.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset