In this paper, we study such practical adaptability
and demonstrate empirically that signicant gains can
be found for the classic non-adaptive algorithms Quick-
sort, Mergesort, and Heapsort, under the measure of
presortedness Inv. Gains of more than a factor of three
are observed.