Spire's 2.10.0 branch just got a nice quicksort implementation which is
faster than Scala's and is competitive with java.util.Arrays. I posted
on Twitter about it last night but here are the notes:
Sean Parsons pointed out that this could be ported to the standard
library. So, my questions are:
1. Is there any chance to specialize scala.math.Ordering? Spire uses a
specialized spire.math.Order which is very similar, without problems.
2. Is there any interest in adapting Scala's existing quickSort to use
this implementation? It seems better across the board.
3. Are there backwards compatibility issues I'm not aware of? I'm
asking now with a view towards 2.11, although I would be willing to try
to port any of it to 2.10.1.
P.S. Would love to get a second pair of eyes on the code, or other
people's results (either confirming or denying my conclusions). The
branch in question is "2.10.0":