Sorting arrays quickly is a classical computer science problem. It is also a common task worth optimizing.

Sadly, there is no best approach, no silver bullet. Most people rely on whatever their programming language provides as a sorting function, but it is almost always suboptimal.

The new Swift language has made an interesting choice for a sorting function. They went with a variation on the textbook quicksort approach called introsort. Introsort is a popular choice, found in C++ standard libraries as well as in the Microsoft .Net platform. Introsort initially works like quicksort, partitioning the data log(n) times, but it then falls back on heapsort. This makes it a robust choice. That is, it is not possible to design a set of ever larger arrays so that the running time of the algorithm goes up quadratically. You have linearithmic complexity. So far, it would seem that the Swift designers made a safe choice… Except for one thing… A critical step in quicksort, and introsort is effectively just a safe variant of quicksort, is to pick a good “pivot”. Swift’s sort function uses the first value as the pivot.

That’s a somewhat odd choice. The state-of-the-art is to pick the median of the first, last and middle element as pivot (median-of-3). Indeed, the GNU ISO C++ standard library uses a median-of-3 pivot (as per the `stl_algo.h` header).

The performance of the sorting algorithm is reliant on the pivot splitting the array in two. That is, the pivot should be close to the median of the array.

But what if your array is already sorted? Then the first value of the array is the worst possible pivot!

We can test it out… calling the `sort` function on an array twice in Swift… the second call is almost assuredly going to take longer…

array.sort() // fast array.sort() // really slow

Of course, that’s silly… why would you sort an array that’s already sorted? Well.

- In some instances, developers do not want to take any chances. They get an array from some other part of the code, they expect the array to be sorted, but they can’t be entirely sure. To be safe, they will sort it again.
- Or maybe the array was sorted but the code had to change a value or two in the array. In these instances, the developer might think that resorting the array ought to be sufficiently cheap.

So even if it sounds silly, actual code often sorts arrays that are nearly sorted. For this reason, Java uses Timsort, a sort function optimized for “almost sorted” data. Swift made the opposite choice: its sort function does poorly on “almost sorted” data.

I think it is useful to know that in Swift, sorting an already sorted array is probably the worse possible scenario. If it happens a lot in your code, then you might want to use a different sort function.

**Update**: According to the comments, this was fixed in Swift’s source code and will probably be fixed in future releases.

Daniel Lemire, "Sorting sorted arrays in Swift," in *Daniel Lemire's blog*, February 6, 2017.

I am not sure I’m looking at the right source code, but this looks like a median-of-3:

https://github.com/apple/swift/blob/master/stdlib/public/core/Sort.swift.gyb#L166-L172

Yes, looks like this was fixed in https://github.com/apple/swift/commit/606bf83af393cdde2ff4de419e833de77226e90f