Datastructures & Algorithms in Elixir
This is a collection of datastructures and algorithms implemented in Elixir.
All the code for these Algorithms is checked into this Github Repo
2024
Stack
·634 words·3 mins·
loading
·
loading
Programming
The Stack is a special data structure. We use lists to augment it and everything is the same, except for 3 small constraints -
Quick Sort
·1095 words·6 mins·
loading
·
loading
Programming
Quick Sort is the go-to sorting algorithm for many programmers due to its efficiency and elegance. Lets implement it in Elixir-
Merge Sort
·875 words·5 mins·
loading
·
loading
Programming
Merge sort is a divide an conquer algorithm that relies solely on recursion to sort a list, making it the ideal algorithm to implement in Elixir.
Insert Sort
·976 words·5 mins·
loading
·
loading
Programming
Insert sort is the defacto algorithm most programmers get started on their journey with. Lets see how to implement it in Elixir.
Introduction
·225 words·2 mins·
loading
·
loading
Programming
Data Structures & Algorithms in Elixir Introduction What happens if you learn Elixir as your first programming language?