Refactor a Caesar Cipher algorithm.

This commit is contained in:
Oleksii Trekhleb
2020-08-08 12:54:56 +02:00
parent bd7475ee19
commit 00242413a5
7 changed files with 129 additions and 72 deletions

View File

@ -135,6 +135,7 @@ a set of rules that precisely define a sequence of operations.
* `A` [Travelling Salesman Problem](src/algorithms/graph/travelling-salesman) - shortest possible route that visits each city and returns to the origin city
* **Cryptography**
* `B` [Polynomial Hash](src/algorithms/cryptography/polynomial-hash) - rolling hash function based on polynomial
* `B` [Caesar Cipher](src/algorithms/cryptography/caesar-cipher) - simple substitution cipher
* **Machine Learning**
* `B` [NanoNeuron](https://github.com/trekhleb/nano-neuron) - 7 simple JS functions that illustrate how machines can actually learn (forward/backward propagation)
* **Uncategorized**