delphi - Pre-sorting analysis algorithm? -

It is a famous release with the query that when the data is in the set or in almost ordering order, the performance is very bad In this case, the summation sort, which is usually very slow, is easily the best option. The question is what is to use.

Whether an algorithm is available to run through a data set, a comparative factor is applied, and returns a report on how the data set is running in a sequential way? I like Delphi / Pascal, but the examples are not very complex, so I can read other languages.

As you expect, many ideas go into this means of mean-of-three techniques That the worst case behavior of Duchessert is not for sorted data, but rather for less obvious cases.

is quite exciting, because it quickly avoids the worst condition of the Quadratik. Instead of its natural question, "How do I find that the data is almost-sorted", it effectively asks itself as it is, "Is it taking too long?" If the answer is yes, then it goes from quicksource to the source itself.

Merge sort with merge sort, and performs very well on sorted or reverse-sorted data, and on the data that are ordered or reverse-sorted subsets.

Then your answer to the question is, "You do not need to have an earlier analysis, you need an adaptive type of algorithm."