Search results
56 packages found
Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using insertion sort.
- stdlib
- stdmath
- mathematics
- math
- blas
- extended
- sort
- order
- arrange
- permute
- insertion
- strided
- array
- ndarray
- View more
Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using insertion sort.
- stdlib
- stdmath
- mathematics
- math
- blas
- extended
- sort
- order
- arrange
- permute
- insertion
- strided
- array
- ndarray
- View more
Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
- stdlib
- stdmath
- mathematics
- math
- blas
- extended
- sort
- order
- arrange
- permute
- insertion
- shell
- shellsort
- strided
- View more
Sort a double-precision floating-point strided array using Shellsort.
- stdlib
- stdmath
- mathematics
- math
- blas
- extended
- sort
- order
- arrange
- permute
- insertion
- shell
- shellsort
- strided
- View more
Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
- stdlib
- stdmath
- mathematics
- math
- blas
- extended
- sort
- order
- arrange
- permute
- insertion
- shell
- shellsort
- strided
- View more
Sort a single-precision floating-point strided array using Shellsort.
- stdlib
- stdmath
- mathematics
- math
- blas
- extended
- sort
- order
- arrange
- permute
- insertion
- shell
- shellsort
- strided
- View more
A sorting library for Node.js
a collection of algorithms written in typescript
- algorithms
- sorting
- data
- structures
- javascript
- typescript
- node
- npm
- search
- linear
- binary
- sort
- insertion
- bubble
- View more
An implementation of John von Neumann's sorted arrays in JavaScript. Implements insertion sort and binary search of JavaScript objects for fast insertion and deletion.
Insertion sorting algorithms for JavaScript
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
- sorted
- array
- add
- element
- whichever
- comparator
- function
- sort
- passed
- supports
- comparator-builder
- options
- reference
- https://github.com/bemoje/bemoje-arr-sort-comparator
- View more
JS/TS library for sorting arrays with different algorithms
Find the array index of where to add an element to keep it sorted.
- find
- array
- index
- add
- element
- sorted
- arr
- insertion
- [compare]
- [comparenumeric=false]
- sort
- numerically
- defaults
- lexicographic/alphabetic
- View more
Sorting by insertion - Look for bigger numbers on the left side. Runtime: O(n^2). It starts from the 2nd element, and it tries to find any element (to the left) that could be bigger than the current index. It will move all the elements that are bigger and
insertion sort an array in typescript
A library of dependency-free common insertion sort algorithms
A Lite(20KB) sorting package that gives the option to the array of objects to sort with several alogithms based on any key of that objects
- sort
- sorting
- object sorting
- bubble
- quick
- merge
- insertion
- selection
- collection sorting
- array of object sorting
``` npm install best-sort --save ```