When we analyze algorithms behavior usually a computational complexity is used as an universal measure of algorithms quality. This measure has some important assumptions; one of them states that it should be independent in input set properties. But when we disregard this assumption it is possible to see how dynamical can be algorithm behavior for input data with different properties. This is especially well visible for sorting, but not only.

I'm looking for someone who will be interested in developing this approach.

Similar questions and discussions