dda3c9cb59
* ref: refactor Levenshtein distance implementation - Rewrite the original levenshtein distance implementation in functional style - Add optimized version of levenshtein distance * ref: make `LevenshteinDistance` class a proper utility * ref: remove duplicated test data * ref: update tests --- Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com> |
||
|---|---|---|
| .devcontainer | ||
| .github | ||
| src | ||
| .clang-format | ||
| .gitignore | ||
| .gitpod.dockerfile | ||
| .gitpod.yml | ||
| checkstyle.xml | ||
| CONTRIBUTING.md | ||
| DIRECTORY.md | ||
| LICENSE | ||
| pom.xml | ||
| README-ko.md | ||
| README.md | ||
| spotbugs-exclude.xml | ||
The Algorithms - Java
You can run and edit the algorithms, or contribute to them using Gitpod.io (a free online development environment) with a single click.
All algorithms are implemented in Java (for educational purposes)
These implementations are intended for learning purposes. As such, they may be less efficient than the Java standard library.
Contribution Guidelines
Please read our Contribution Guidelines before you contribute to this project.
Algorithms
Our directory has the full list of applications.