Algorithm Theory — SWAT '92

Volume 621 of the series Lecture Notes in Computer Science pp 422-433


A framework for adaptive sorting

  • Ola PeterssonAffiliated withDept. Comp. Sci., Lund Univ.
  • , Alistair MoffatAffiliated withDept. Comp. Sci., Univ. Melbourne

* Final gross prices may vary according to local VAT.

Get Access


A sorting algorithm is adaptive if it sorts sequences that are close to sorted faster than it sorts random sequences, where the distance is determined by some measure of presortedness. Over the years several measures of presortedness have been proposed in the literature, but it has been far from clear how they relate to each other. We show that there exists a natural partial order on the set of measures, which makes it possible to say that some measures are superior to others. We insert all known measures of presortedness into the partial order, and thereby provide a powerful tool for evaluating both measures and adaptive sorting algorithms. We further present a new measure and show that it is a maximal known element in the partial order, and thus that any sorting algorithm that optimally adapts to the new measure also optimally adapts to all other known measures of presortedness.