SelectLike
Given a function for finding approximate medians, this will create an exact median finder.
Value members
Abstract methods
Concrete methods
final
def partition[@specialized A](data: Array[A], left: Int, right: Int, stride: Int)(m: A)(implicit o: Order[A]): Int
final
Puts the k-th element of data, according to some Order, in the k-th position. All values before k are less than or equal to data(k) and all values above k are greater than or equal to data(k).
Puts the k-th element of data, according to some Order, in the k-th position. All values before k are less than or equal to data(k) and all values above k are greater than or equal to data(k).
This is an in-place algorithm and is not stable and it WILL mess up the order of equal elements.
@tailrec
final protected
def select[@specialized A : Order](data: Array[A], left: Int, right: Int, stride: Int, k: Int): Unit
final
def sort[@specialized A](data: Array[A], left: Int, right: Int, stride: Int)(implicit o: Order[A]): Unit