🔀 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.
An android app to play with Donald Knuth's conjecture who stated that we can build any integer starting from 4 using only floor, square root and factorial
Arithmetic expressions without redundant parentheses. Knuth's TAOCP has Dudeney's Digital Century puzzle 7.2.1.6 problem 122 and it includes a description of expression grammar that generates expressions without redundant parentheses.
There are two implementations available in this folder in C/C++. First one is of Dynamic Hashing using Binary Tree with Page size at each node. The second one is of Knuth Hash Function performance evaluation using a text file as input.