« earlier | later » Page 1 of 1
gmane.comp.java.openjdk.core-libs.devel
Two-pivot quicksort. Can this be generalised to N-pivot quicksort (yes), and where's the optimum point for the tradeoff between recursion cost and wrangling pivots?
« earlier | later » Page 1 of 1
| - quicksort | |
| 1 | algorithm |
| 1 | cs |
| 1 | quicksort |
| 1 | sorting |
tasty by Adam Sampson.