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:
“Profundity easily turns into dullness and astuteness deteriorates into wit. Be guided by natural common sense and it will accommodate great and small.”
—Franz Grillparzer (1791–1872)
“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)
“... it must be obvious that in the agitation preceding the enactment of [protective] laws the zeal of the reformers would be second to the zeal of the highly paid night-workers who are anxious to hold their trade against an invasion of skilled women. To this sort of interference with her working life the modern woman can have but one attitude: I am not a child.”
—Crystal Eastman (1881–1928)