Add Brent's Method for root finding (Hacktoberfest 2025)

[studentpiyush]

Feature: Brent’s Method for root finding (Numerical Analysis)

Description:
This PR implements Brent’s Method, a robust and efficient algorithm for finding zeros of functions. It combines bisection, secant, and inverse quadratic interpolation.

Motivation:
Adding Brent’s Method enhances the repository’s collection of numerical root-finding algorithms. It is widely regarded as reliable and fast for scientific computing.

References:

Brent's Method - Wikipedia

SciPy documentation

Hacktoberfest 2025 Contribution: ✅

Checklist:

• I have read the contributing guidelines
• My code follows the style of this project
• I have added tests if applicable
• I have added documentation if applicable

[algorithms-keeper]

Closing this pull request as invalid

@studentpiyush, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines.

If you're facing any problem on how to mark a checkbox, please read the following instructions:

• Read a point one at a time and think if it is relevant to the pull request or not.
• If it is, then mark it by putting a x between the square bracket like so: [x]

NOTE: Only [x] is supported so if you have put any other letter or symbol between the brackets, that will be marked as invalid. If that is the case then please open a new pull request with the appropriate changes.