feat: Add Neville's Algorithm #6842
Merged
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.
Description
This pull request adds Neville's algorithm, a method for polynomial interpolation. Given a set of points, it efficiently calculates the value of the interpolating polynomial at a specified x-coordinate.
Algorithm Explanation
n+1given points. It builds up the solution by considering polynomials of increasing degrees.Implementation Details
Neville.javain thecom.thealgorithms.mathspackage.interpolatemethod to perform the calculation.NevilleTest.javato verify correctness with linear, quadratic, and negative-valued functions. Tests for edge cases like empty or mismatched input arrays are also included.clang-format -i --style=file path/to/your/file.java