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:
“There is nothing more natural than to consider everything as starting from oneself, chosen as the center of the world; one finds oneself thus capable of condemning the world without even wanting to hear its deceitful chatter.”
—Guy Debord (b. 1931)
“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)
“The curse of me & my nation is that we always think things can be bettered by immediate action of some sort, any sort rather than no sort.”
—Ezra Pound (1885–1972)