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:
“Many people operate under the assumption that since parenting is a natural adult function, we should instinctively know how to do it—and do it well. The truth is, effective parenting requires study and practice like any other skilled profession. Who would even consider turning an untrained surgeon loose in an operating room? Yet we “operate” on our children every day.”
—Louise Hart (20th century)
“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)
“Provision there had been for just such meeting
Of stranger-cousins, in a family tree
Drawn on a sort of passport with the branch
Of the one bearing it done in detail”
—Robert Frost (1874–1963)