Domain name permutation engine written in Go

Multiple hypothesis testing in Python

Code accompanying the paper "Learning Permutations with Sinkhorn Policy Gradient"

Permutations and permutation groups in Common Lisp.

Computational Group Theory in Scala. It's Scala permuted!

Implementation of the Hades permutation algorithm used in Poseidon Hashes with ZKProof capabilities.

Permutation algorithms to test statistical significance of experimental results.

Permutation learning Sinkhorn layer implementation in keras

Simulate a variety of twisty puzzles.

Gword is a web app that generates all possible combinations of letters that make up an english word when provided by a set of letters and a limit. It is written in Go and utilizes Websockets.

Algorithmes et Structures de Données 1 - Département TIC - HEIG-VD

Verilog source for my green Lifemidi box, for producing lights and MIDI-music.

Two programs that illustrate the creation of OEIS array A089840, which lists signature permutations of non-recursive Catalan automorphisms, that is, bijections of finite plane binary trees, with no unlimited recursion down to indefinite distances from the root.

[Tsinghua University — C&A] Permutation generation

A pure Python library for dealing with permutations

Alpha-Binary Generator is fastest sequential binary generator for C. it can generate binary to FILE or to console at great speed 4x times speed than normal generator.

Some useful problems in python related to it's concepts and data structures

Codes I developed for fun. General Algorithms and Popular Coding Problems.

Invertible transformations on permutation representations, including an RNG-free in-place Fisher-Yates-Knuth shuffle https://www.npmjs.com/package/factoradic

Permutations in lexicographic order

Program for searching cheapest path in graph

Algorithms based on dynamic programming

BruteForce tool

PERT, Enumerations and combinations, Enumerations of topological ordering of a graph

A back-of-the-envelope permutations generator.

Permutations can be considered as the orbits of a dynamic system p' = succ(p), where p is a permutation and p' is its successor in the lexycographically ordered set of permutations (plus the Nil permutation, whose successor is Nil). Here I present a function that produces those orbits as well as a number of "permutation numbers" derived from those orbits.

Algorithms and Common Problems

permutation cipher for encrypting and decrypting a hexadecimal string