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:
“As a natural process, of the same character as the development of a tree from its seed, or of a fowl from its egg, evolution excludes creation and all other kinds of supernatural intervention.”
—Thomas Henry Huxley (1825–95)
“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)
“Green politics at its worst amounts to a sort of Zen fascism; less extreme, it denounces growth and seeks to stop the world so that we can all get off.”
—Chris Patten (b. 1944)