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:
“A person who can’t pay gets another person who can’t pay to guarantee that he can pay. Like a person with two wooden legs getting another person with two wooden legs to guarantee that he has got two natural legs. It don’t make either of them able to do a walking-match.”
—Charles Dickens (1812–1870)
“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)
“I am a sort of martyr, as you see,
A horizontal monument to patience.
The calves of waitresses parade about
My helpless head upon this sodden floor.
Well, I am down again, but not yet out.
O sweet frustrations, I shall be back for more.”
—Richard Wilbur (b. 1921)