Search results

36 packages found

Binary search -based indexOf for sorted arrays.

published 1.0.2 4 years ago
M
Q
P

Sort an array considerably faster than the native Array.prototype.sort as a drop-in replacement. Fork of of the famous timsort module, but this module allows for passing comparator-builder options instead of a comparator function. In short, advanced compa

published 1.0.2 4 years ago
M
Q
P

For a sorted array, add an element. Whichever comparator function was used to sort the array, can be passed. Also supports comparator-builder options. For reference, see: https://github.com/bemoje/bemoje-arr-sort-comparator

published 1.0.4 4 years ago
M
Q
P

Remove all duplicate elements in a sorted array, leaving only uniques.

published 1.0.1 4 years ago
M
Q
P

Find the array index of where to add an element to keep it sorted.

published 3.0.2 4 years ago
M
Q
P

Binary search -based indexOf for sorted arrays.

published 1.0.2 4 years ago
M
Q
P

Find all indexes at which an array element exists, by binary search.

published 1.0.1 4 years ago
M
Q
P
M
Q
P

Like Unix seq, but geometric

published 1.1.0 9 years ago
M
Q
P

Create comparator from key or less function

published 0.2.0 8 years ago
M
Q
P

Compose multiple sorting functions

published 1.0.0 5 years ago
M
Q
P

Heap sort descending

published 1.0.3 3 years ago
M
Q
P
M
Q
P

Sort an array by descending values via insertion sort, pass by value

published 1.0.0 6 years ago
M
Q
P

Sort numbers in ascending or descending order

published 1.0.3 9 years ago
M
Q
P

Sorting Arrays of Numbers in JavaScript, Find Largest and Smallest Number.

published 0.1.5 3 years ago
M
Q
P