High performance Bitcoin development platform
-
Updated
May 21, 2024 - Python
High performance Bitcoin development platform
New Shuffle algorithm with ultra low overhead and no annoying repetition.
Shuffle elements of an array-like object.
javascript array shuffler [fisher yates knuth durstenfeld]
A literate programming system for any language.
Final Projects are required for both Graduate Students and PHY 451Y students. Students can choose to work individually or in groups of two to propose, perform, and present a final project for the course. This project will be a project that uses methods taught in this course to solve a data analysis or signal processing problem.
Julia implementation of Knuth's solver for two-person games with an example game
🔀 The standard algorithm for generating a uniformly chosen random permutation. Devised by Ronald Fisher and Frank Yates, modernized by Richard Durstenfeld and popularized by Donald E. Knuth. This version permits Sattolo cycles as well as seeded/keyed shuffles and unshuffles.
Numerical investigation into the distributional analysis of the time complexity of Euclid's algorithm. Sheds numerical light on an "obscure" constant related to a certain variance.
Algoritms & data structures implementation library. Plus math problems and solutions of puzzle from CodingBat and Advent of Code. Keywords: Shell sort, Knuth sequence, insertion, quick, merge, selection, queues, stack, list.
Implements "Algorithm M: Covering with Multiplicities and Colors."
Experiments with Knuth's 5,757 five letter words.
Sample code in MMIX assembly language
Add a description, image, and links to the knuth topic page so that developers can more easily learn about it.
To associate your repository with the knuth topic, visit your repo's landing page and select "manage topics."