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:
“English general and singular terms, identity, quantification, and the whole bag of ontological tricks may be correlated with elements of the native language in any of various mutually incompatible ways, each compatible with all possible linguistic data, and none preferable to another save as favored by a rationalization of the native language that is simple and natural to us.”
—Willard Van Orman Quine (b. 1908)
“Popular art is normally decried as vulgar by the cultivated people of its time; then it loses favor with its original audience as a new generation grows up; then it begins to merge into the softer lighting of “quaint,” and cultivated people become interested in it, and finally it begins to take on the archaic dignity of the primitive.”
—Northrop Frye (b. 1912)
“And since the average lifetime—the relative longevity—is far greater for memories of poetic sensations than for those of heartbreaks, since the very long time that the grief I felt then because of Gilbert, it has been outlived by the pleasure I feel, whenever I wish to read, as in a sort of sundial, the minutes between twelve fifteen and one o’clock, in the month of May, upon remembering myself chatting ... with Madame Swann under the reflection of a cradle of wisteria.”
—Marcel Proust (1871–1922)