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:
“And if anyone should think I am tracing this matter too curiously, I, who have considered it in various shapes, can only answer with Hamlet ... “Not a jot”; it being no more than the natural result of examining and considering the subject.”
—Sarah Fielding (1710–1768)
“We don’t know when our name came into being or how some distant ancestor acquired it. We don’t understand our name at all, we don’t know its history and yet we bear it with exalted fidelity, we merge with it, we like it, we are ridiculously proud of it as if we had thought it up ourselves in a moment of brilliant inspiration.”
—Milan Kundera (b. 1929)
“There is a sort of homely truth and naturalness in some books which is very rare to find, and yet looks cheap enough. There may be nothing lofty in the sentiment, or fine in the expression, but it is careless country talk. Homeliness is almost as great a merit in a book as in a house, if the reader would abide there. It is next to beauty, and a very high art. Some have this merit only.”
—Henry David Thoreau (1817–1862)