simple-combinatorics
A simple permutations and combinatorics library for JavaScript
A simple permutations and combinatorics library for JavaScript
returns a list of all possible combinations / permutations of an array of items
Get all possible permutations of a given length, and a given array of attributes.
Validates if a value is a permutation.
A permutation script based on SEPA
A small, pointless package that scrambles values...
A fully-functional functional lexicographic permutation generator generator.
A fully-functional functional lexicographic permutation generator generator.
next permutation from lexicographic order of an array, a'la Narayana Pandita in 14th century India.
Invertible transformations on permutation representations, including an RNG-free in-place Fisher-Yates-Knuth shuffle
An implementation of the Johnson-Trotter permutation algorithm.
Utility package for permutations, including Lehmer codes.
Create permutations use ES6's generator
A simple statistics library
Transpose a matrix (or a stack of matrices).
Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.
Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using insertion sort.
Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
Sort a single-precision floating-point strided array using heapsort.
Sort a single-precision floating-point strided array using insertion sort.