thealgorithms/elixir — explained in plain English
Analysis updated 2026-07-23 · repo last pushed 2024-06-24
Study how sorting and pathfinding algorithms work by reading clear Elixir code.
Learn Elixir syntax and functional programming patterns through real algorithm examples.
Contribute a new algorithm or improve existing code as part of a community learning project.
| thealgorithms/elixir | thatsme/alexclaw | atuinsh/atuin-ai-server | |
|---|---|---|---|
| Stars | 263 | 114 | 53 |
| Language | Elixir | Elixir | Elixir |
| Last pushed | 2024-06-24 | — | — |
| Maintenance | Dormant | — | — |
| Setup difficulty | easy | hard | moderate |
| Complexity | 1/5 | 4/5 | 3/5 |
| Audience | developer | developer | developer |
Figures from each repo's GitHub metadata at analysis time.
Just clone and browse the code files, no build step or dependencies required to read and learn from the implementations.
This repository is a collection of classic computer algorithms written in the Elixir programming language, designed for educational purposes. It's part of a larger, community-driven effort to show how common algorithms work in many different languages. Algorithms are basically step-by-step recipes for solving problems, like sorting a list of names alphabetically or finding the shortest path between two points. Instead of just describing these recipes in plain English, this project shows the actual code. It covers a wide variety of algorithms, organized in a directory you can browse by category. The main audience is people learning how algorithms work or anyone learning Elixir. If you're a beginner trying to understand a sorting algorithm, you can look at the code here and see exactly how it's built step by step. The project is also open to contributions, meaning people can add new algorithms or improve the explanations. It's not meant to be a production toolkit that you plug into a real app, the README explicitly notes these implementations may be less efficient than what's already built into Elixir's standard library. The main tradeoff here is clarity over performance. Because the goal is teaching, the code is written to be readable and understandable rather than fast or optimized. The README doesn't go into detail about which specific algorithms are included, but points to a separate directory listing for that. There's also a community chat where contributors can discuss the project and ask questions.
A collection of classic algorithms like sorting and pathfinding written in Elixir for learning. The code focuses on being clear and readable rather than fast, making it great for students and Elixir beginners.
Mainly Elixir. The stack also includes Elixir.
Dormant — no commits in 2+ years (last push 2024-06-24).
Open source project welcoming community contributions, though the specific license is not stated in the README.
Setup difficulty is rated easy, with roughly 5min to a first successful run.
Mainly developer.
This repo across BitVibe Labs
Verify against the repo before relying on details.