Skip to content
A collaborative book on algorithms
Branch: master
Clone or download
leios Merge pull request #596 from ADedecker/euclidean_algorithm_in_d
An implementation of Euclidean Algorithm in D
Latest commit 14b9cde Mar 24, 2019
Type Name Latest commit message Commit time
Failed to load latest commit information.
.github adding some templates to be modified in review (#569) Mar 21, 2019
styles Fix website.css Aug 11, 2018
.editorconfig Added crystal to .editorconfig (#523) Oct 20, 2018
.gitignore Added package-lock.json to .gitignore (#525) Oct 20, 2018
.travis.yml Markdown formatting updates (#440) Oct 4, 2018 Markdown formatting updates (#440) Oct 4, 2018 removing convolutions chapter while reworking it Dec 29, 2018
literature.bib adding code to FFT chapter and more algorithms that have already been… Jan 3, 2018 Implement completely flat hierarchy (#268) Jul 19, 2018
redirects.json Implement completely flat hierarchy (#268) Jul 19, 2018


We do not yet accept entirely new chapters by everyone. If you would like to start working on one, please contact James Schloss (Leios) first. If you create a full chapter, including text, and submit it as a pull request it is most likely going to get rejected.

If you want to help, it is best to write language examples for existing chapters. You can also try to find spelling or other mistakes in existing chapters and submit fixes for those.

The Arcane Algorithm Archive

The Arcane Algorithm Archive is a collaborative effort to create a guide for all important algorithms in all languages. This goal is obviously too ambitious for a book of any size, but it is a great project to learn from and work on and will hopefully become an incredible resource for programmers in the future.

Here are some essential links:

Note that this project is essentially a book about algorithms collaboratively written by an online community. Fortunately, there are a lot of algorithms out there, which means that there is a lot of content material available. Unfortunately, this means that we will probably never cover every algorithm ever created and instead need to focus on what the community sees as useful and necessary. That said, we'll still cover a few algorithms for fun that have very little, if any practical purpose.

If you would like to contribute, feel free to go to any chapter with code associated with it and implement that algorithm in your favorite language, and then submit the code via pull request. You can find help and instructions regarding the contribution process in our How to Contribute wiki entry.

Hopefully, this project will grow and allow individuals to learn about and try their hand at implementing different algorithms for fun and (potentially) useful projects. If nothing else, it will be an enjoyable adventure for our community.

Thanks for reading and let me know if there's anything wrong or if you want to see something implemented in the future!


The code examples for this project are licensed under the MIT license (found in All text content is licensed under the Creative Commons Attribution-ShareAlike 4.0 International License with attribution specified at the end of every chapter. All graphics are licensed under the license stated at the end of every chapter. If no attribution is specified, please attribute James Schloss.

You can’t perform that action at this time.