ABSTRACT
Usually, the efficiency of an algorithm is measured as its time complexity and its space complexity. However, since the size of computer memories has tremendously increased over the past years, space complexity is a less and less critical criterion. There are numerous sorting algorithms which, generally, call on two elementary operations: evaluation of condition and exchange. In some problems, sorting is an initial step and it will be assumed that one of the most efficient at worst is used, whose asymptotic time complexity is quasi linear in terms of comparisons and/or exchanges. However, for some algorithms, complexity is evaluated considering data themselves.
