Finds the kth element in an ndarray in linear time with high probability. This implementation is based on the quick select algorithm and mutates the array in place.
var pack = require("ndarray-pack")
var ndselect = require("ndarray-select")
var points = pack([0, 0, 1, 2.5, -1])
//Find the median element in the list
var median = ndselect(points, points.shape[0]>>1)
console.log(median.get())0 2.5 -1
It is also possible to select vectors (using lexicographical comparisons):
var pack = require("ndarray-pack")
var ndselect = require("ndarray-select")
var points = pack([
[0, 0, 1],
[100, 0, 10],
[50, 1, 10],
[0, 2.5, -1],
[-1, -1, -1]
])
//Find the median element in the list
var median = ndselect(points, points.shape[0]>>1)
console.log(median.get(0), median.get(1), median.get(2))0 2.5 -1
Install using npm:
npm install ndarray-select
var ndselect = require("ndarray-select")Selects the kth item from the ndarray array along the first axis of array.
arrayis an ndarraykis the rank of the item which is being selectedcompareis an optional comparison function that gets a pair of ndarrays as input.
Returns An ndarray view of array.pick(k)
Note This method modifies array. After completion, the element at position k will be in sorted order, with all elements <array.pick(k) occuring before k and all elements >array.pick(k) after k in the list.
Precompiles an optimized selection algorithm for an array with the given index order and datatype.
orderis the order of the ndarrayuseCompareis a flag which if set uses a comparison functiondtypeis the datatype of the array
Returns An optimized ndselect function
(c) 2014 Mikola Lysenko. MIT License
