Famous algorithms defined in a functional fashion.
These implementations make use of functional programming techniques like laziness, recursion, and immutability. Performance isn't a priority.
To run tests, you need leiningen. run tests with
$ lein test
or
$ lein auto test
- Insertion sort
- Selection sort
- Quick sort
- Merge sort
- Bubble sort
- Binary Search
- Depth first Search
- Breadth first Search
- Dijkstra's algorithm
- A* search algorithm
Copyright © 2021 FIXME
This program and the accompanying materials are made available under the terms of the Eclipse Public License 2.0 which is available at http://www.eclipse.org/legal/epl-2.0.
This Source Code may also be made available under the following Secondary Licenses when the conditions for such availability set forth in the Eclipse Public License, v. 2.0 are satisfied: GNU General Public License as published by the Free Software Foundation, either version 2 of the License, or (at your option) any later version, with the GNU Classpath Exception which is available at https://www.gnu.org/software/classpath/license.html.