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:
“We do not want them to have less.
But it is only natural that we should think we have not enough.
We drive on, we drive on.
When we speak to each other our voices are a little gruff.”
—Gwendolyn Brooks (b. 1917)
“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)
“If everything is perfect, language is useless. This is true for animals. If animals don’t speak, it’s because everything’s perfect for them. If one day they start to speak, it will be because the world has lost a certain sort of perfection.”
—Jean Baudrillard (b. 1929)