Skip to content

Refactor Levenshtein distance implementation #5138

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
May 4, 2024

Conversation

sozelfist
Copy link
Contributor

Changes

  • Rewrite the original levenshtein distance implementation in functional style
  • Add optimized version of levenshtein distance
  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized it.
  • All filenames are in PascalCase.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
  • All new code is formatted with clang-format -i --style=file path/to/your/file.java

@codecov-commenter
Copy link

codecov-commenter commented May 2, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 37.37%. Comparing base (b3903f5) to head (9d4da7c).

Additional details and impacted files
@@             Coverage Diff              @@
##             master    #5138      +/-   ##
============================================
+ Coverage     37.35%   37.37%   +0.02%     
- Complexity     2350     2351       +1     
============================================
  Files           517      517              
  Lines         15618    15613       -5     
  Branches       2971     2968       -3     
============================================
+ Hits           5834     5836       +2     
+ Misses         9496     9490       -6     
+ Partials        288      287       -1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@sozelfist sozelfist requested a review from vil02 May 3, 2024 01:09
@sozelfist sozelfist force-pushed the ref/dp/levenshtein_distance branch from 0883eb8 to 632f456 Compare May 3, 2024 01:09
sozelfist added 3 commits May 4, 2024 06:12
- Rewrite the original levenshtein distance implementation in functional style
- Add optimized version of levenshtein distance
@sozelfist sozelfist force-pushed the ref/dp/levenshtein_distance branch from 632f456 to 1d759cb Compare May 3, 2024 23:12
@sozelfist sozelfist requested a review from vil02 May 3, 2024 23:26
@vil02 vil02 merged commit dda3c9c into TheAlgorithms:master May 4, 2024
5 checks passed
@sozelfist sozelfist deleted the ref/dp/levenshtein_distance branch May 4, 2024 12:05
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants