compose-sort
Compose multiple sorting functions
Compose multiple sorting functions
Calculate ascending and descending moon between 2001 and 2100.
Like Unix seq, but geometric
Sort an array by ascending values via insertion sort, pass by value
Order object by ascending or descending
Sorting Arrays of Numbers in JavaScript, Find Largest and Smallest Number.
Binary search -based indexOf for sorted arrays.
Find all indexes at which an array element exists, by binary search.
Find the array index of where to add an element to keep it sorted.
Remove all duplicate elements in a sorted array, leaving only uniques.
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
Create array comparator function.
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
Binary search -based indexOf for sorted arrays.
Function takes an array of numbers and returns new array with numbers in ascending order
Function takes an array of numbers and returns new array with numbers in numeric order
Simple JS library to sort different elements of an array
Sort array elements with Bubble Sort.
Sort array elements with Insertion Sort.
Sort array elements with Selection Sort.