Permute Packages

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.

An implementation of the Johnson-Trotter permutation algorithm.

Create permutations use ES6's generator

Utility package for permutations, including Lehmer codes.

Invertible transformations on permutation representations, including an RNG-free in-place Fisher-Yates-Knuth shuffle

A simple statistics library

Iterate permutations described by a states object.

A quite fast non-recursive permutation algorithm, Steinhaus–Johnson–Trotter algorithm (Even's speedup)

A JavaScript implementation of Heap's efficient Permutation Algorithm

Simultaneously sort two strided arrays based on the sort order of the first array using heapsort.

Simultaneously sort two strided arrays based on the sort order of the first array using insertion sort.

Sort a double-precision floating-point strided array using Shellsort.