Natural Merge Sort
A natural merge sort is similar to a bottom up merge sort except that any naturally occurring runs (sorted sequences) in the input are exploited. In the bottom up merge sort, the starting point assumes each run is one item long. In practice, random input data will have many short runs that just happen to be sorted. In the typical case, the natural merge sort may not need as many passes because there are fewer runs to merge. For example, in the best case, the input is already sorted (i.e., is one run), so the natural merge sort need only make one pass through the data.
Read more about this topic: Merge Sort
Famous quotes containing the words natural, merge and/or sort:
““Having reached the term of his natural life”; Mwould it not be truer to say, Having reached the term of his unnatural life?”
—Henry David Thoreau (1817–1862)
“I too but signify at the utmost a little wash’d-up drift,
A few sands and dead leaves to gather,
Gather, and merge myself as part of the sands and drift.”
—Walt Whitman (1819–1892)
“I fly in dreams, I know it is my privilege, I do not recall a single situation in dreams when I was unable to fly. To execute every sort of curve and angle with a light impulse, a flying mathematics—that is so distinct a happiness that it has permanently suffused my basic sense of happiness.”
—Friedrich Nietzsche (1844–1900)