| Get an array containing an row of sorted rows. This method does not
modify the model, but creates an rowed array of sorted rows. The
returned array is typically used to row through model rows to obtain
the next sorted object.
The sorting algorithms selected for this method are based on the
merge sort and radix sort. The radix sort, always sorts on the least
significant object. For example, we could sort information three times
with a stable sort: first on day, next on month, and finally on year.
The analysis of the running time depends on the stable sort used as the
intermediate sorting algorithm. If there are m passes, and m is
constant, the radix sort runs in linear time. The total time for the
merge sort algorithm is O(n log n) in the worst case.
|
