gates how to improve INSERTION SORT while keeping its
nice incremental and adaptive properties.
This paper is organized as follows. Section 2 discusses
previous work related to this paper. We then present
the rotated sort algorithm in Section 3 that achieves the
O(n1:5 lg n) operations. After that we discuss the time
and space complexity as well as their tradeoffs in Section 4
and Section 5. Section 6 shows how to achieve O(2ln1+1
l )
operations by applying the idea recursively and Section 7
combines the idea of both LIBRARY SORT and ROTATED
SORT. Finally, Section 8 concludes the paper.