mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
4d0c830d2c
* ci(pre-commit): Add ``flake8-builtins`` additional dependency to ``pre-commit`` (#7104) * refactor: Fix ``flake8-builtins`` (#7104) * fix(lru_cache): Fix naming conventions in docstrings (#7104) * ci(pre-commit): Order additional dependencies alphabetically (#7104) * fix(lfu_cache): Correct function name in docstring (#7104) * Update strings/snake_case_to_camel_pascal_case.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update data_structures/stacks/next_greater_element.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update digital_image_processing/index_calculation.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update graphs/prim.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update hashes/djb2.py Co-authored-by: Christian Clauss <cclauss@me.com> * refactor: Rename `_builtin` to `builtin_` ( #7104) * fix: Rename all instances (#7104) * refactor: Update variable names (#7104) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * ci: Create ``tox.ini`` and ignore ``A003`` (#7123) * revert: Remove function name changes (#7104) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Rename tox.ini to .flake8 * Update data_structures/heap/heap.py Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com> * refactor: Rename `next_` to `next_item` (#7104) * ci(pre-commit): Add `flake8` plugin `flake8-bugbear` (#7127) * refactor: Follow `flake8-bugbear` plugin (#7127) * fix: Correct `knapsack` code (#7127) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com>
65 lines
1.3 KiB
Python
65 lines
1.3 KiB
Python
import math
|
|
|
|
|
|
def fx(x: float, a: float) -> float:
|
|
return math.pow(x, 2) - a
|
|
|
|
|
|
def fx_derivative(x: float) -> float:
|
|
return 2 * x
|
|
|
|
|
|
def get_initial_point(a: float) -> float:
|
|
start = 2.0
|
|
|
|
while start <= a:
|
|
start = math.pow(start, 2)
|
|
|
|
return start
|
|
|
|
|
|
def square_root_iterative(
|
|
a: float, max_iter: int = 9999, tolerance: float = 0.00000000000001
|
|
) -> float:
|
|
"""
|
|
Square root is aproximated using Newtons method.
|
|
https://en.wikipedia.org/wiki/Newton%27s_method
|
|
|
|
>>> all(abs(square_root_iterative(i)-math.sqrt(i)) <= .00000000000001
|
|
... for i in range(500))
|
|
True
|
|
|
|
>>> square_root_iterative(-1)
|
|
Traceback (most recent call last):
|
|
...
|
|
ValueError: math domain error
|
|
|
|
>>> square_root_iterative(4)
|
|
2.0
|
|
|
|
>>> square_root_iterative(3.2)
|
|
1.788854381999832
|
|
|
|
>>> square_root_iterative(140)
|
|
11.832159566199232
|
|
"""
|
|
|
|
if a < 0:
|
|
raise ValueError("math domain error")
|
|
|
|
value = get_initial_point(a)
|
|
|
|
for _ in range(max_iter):
|
|
prev_value = value
|
|
value = value - fx(value, a) / fx_derivative(value)
|
|
if abs(prev_value - value) < tolerance:
|
|
return value
|
|
|
|
return value
|
|
|
|
|
|
if __name__ == "__main__":
|
|
from doctest import testmod
|
|
|
|
testmod()
|