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 are educated in the grossest ignorance, and no art omitted to stifle our natural reason; if some few get above their nurses’ instructions, our knowledge must rest concealed and be as useless to the world as gold in the mine.”
—Mary Wortley, Lady Montagu (1689–1762)
“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)
“Whereas children can learn from their interactions with their parents how to get along in one sort of social hierarchy—that of the family—it is from their interactions with peers that they can best learn how to survive among equals in a wide range of social situations.”
—Zick Rubin (20th century)