Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Summary of the Change:
This pull request introduces the Minkowski distance algorithm, which calculates the distance between two points in an N-dimensional space for a given order. The Minkowski distance generalizes both the Manhattan distance (order = 1) and the Euclidean distance (order = 2). It is defined as the p-th root of the sum of the absolute differences raised to the power of p between the coordinates of the points. Source
Motivation
Similar to my previous contributions, I wanted to include this algorithm since it is present in other language repositories, such as Python.