2.3.3 Rotated Sort
ROTATED INSERTION SORT, or just ROTATED SORT for
short, is based on the idea of the implicit data structure
called rotated list (Munro & Suwanda 1979). Implicit data
structure is where the relative ordering of the elements is
stored implicitly in the pattern of the data structure, rather
than explicitly storing the relative ordering using offsets
or pointers. Rotated list achieves O(n1:5 lg n) operations
using constant O(w) bits temporary space, or O(n1:5) operations
with extra (pn lg n) bits temporary space, regardless
of w. It is adaptive as its runtime depends on
inv(X). It is incremental as select can be done in constant
time.