ExAlgo

ExAlgo is a collection of data structures and algorithms implemented in Elixir. This is the authors attempt to see algorithms through Elixir's lens.

Installation

If available in Hex, the package can be installed by adding ex_algo to your list of dependencies in mix.exs:

def deps do
  [
    {:ex_algo, "~> 0.1.0"}
  ]
end

Run mix test to run all the tests.

Documentation can be generated with ExDoc and published on HexDocs. Once published, the docs can be found at https://hexdocs.pm/ex_algo.

0 Open More issues

Closed

Implement the MinMaxStack. Fixes #3

null

opened Mar 6, 2022 by code-shoily 1

Closed

Implement a Stack with Min/Max functions

Let's implement a stack that, in addition to being a LIFO, also returns the minimum and maximum at any given point. As an example, if we push, [10, 3, 20, -2, 4] into a stack, then, while push and pop will retain the LIFO properties, min will return -2 and max will return 20. However, 3 pop-s later, min will return 3 and max will return 10. And if we push 1 and 200 after this, then min will return 1 and max - 200.

min and max should take constant time.

Optionally, there could be pop_min and pop_max which would keep popping until the minimum is popped out, and pop_max would do the same for maximum value. These could be done in linear time

enhancement

opened Mar 6, 2022 by code-shoily 0

Closed

Create LICENSE

null

opened Nov 27, 2021 by code-shoily 0

Open

Implement BinarySearchTree.delete

I don't know what's wrong with me and BinarySearchTree deletions. I delayed it in school, then in my other, algorithms-in-dart repository, and now here too. Anyone picking it up would be awesome but I think I will address it this weekend any way.

Putting this up to remind myself for this.

opened Nov 26, 2021 by code-shoily 0