Quicksort

Quicksort is a well-known sorting algorithm developed by C. A. R. Hoare that, on average, makes O(nlogn) comparisons to sort n items. In the worst case, it makes O(n2) comparisons. Typically, quicksort is significantly faster in practice than other O(nlogn) algorithms, because its inner loop can be efficiently implemented on most architectures, and in most real-world data, it is possible to make design choices which minimize the probability of requiring quadratic time.

Quicksort is a comparison sort and, in efficient implementations, is not a stable sort.

If the array is returned the same, then it did not recognize the Version string.

More info: http://en.wikipedia.org/wiki/Quicksort