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:
“Writers and politicians are natural rivals. Both groups try to make the world in their own images; they fight for the same territory.”
—Salman Rushdie (b. 1947)
“If men at forty will be painting lakes
The ephemeral blues must merge for them in one,
The basic slate, the universal hue.”
—Wallace Stevens (1879–1955)
“It’s red hot, mate. I hate to think of this sort of book getting in the wrong hands. As soon as I’ve finished this, I shall recommend they ban it.”
—Tony Hancock (1924–1968)