Array::sort is a fast, easy way to sort arrays. Unfortunately, sometimes you want to test out different sorting algorithms, or feel that Array::sort doesn't use the optimal algorithm for your code. rSort will be a module that provides a set of methods to allow various sort algorithms to be applied to arrays of comparable objects. It will include as many algorithms as possible, considering its raison d'etre, including a half-dozen or so O(n2) algorithms, several O(n log n), and possible support for sort networks. In addition, it will include methods for timing sorts to allow easy comparison of performance, and have many options for output, from simple returns to full traces.
It does, doesn't it? It's fast, that's for sure! Why would anyone bother using anything else? 4 reasons: