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:
“Knowledge has two extremes. The first is the pure natural ignorance in which all men find themselves at birth. The other extreme is that reached by great minds, who, having run through all that men can know, find they know nothing, and come back again to that same natural ignorance from which they set out; this is a learned ignorance which is conscious of itself.”
—Blaise Pascal (1623–1662)
“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)
““The unities, sir,’ he said, “are a completeness—a kind of universal dovetailedness with regard to place and time—a sort of general oneness, if I may be allowed to use so strong an expression. I take those to be the dramatic unities, so far as I have been enabled to bestow attention upon them, and I have read much upon the subject, and thought much.””
—Charles Dickens (1812–1870)