DESCENDING Packages

Like Unix seq, but geometric

Sort an array by descending 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.

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

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.

This package lets you sort your array in ascending or descending order with many different algorithms.

Creating a npm package for different functions

A powerful JavaScript library for sorting arrays of numbers with enhanced performance and additional features. It supports various number formats, handles special values like NaN and Infinity, and offers customizable sorting options. Easy to integrate and

Sort an array of objects by one or more properties.