mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
30 lines
800 B
Python
30 lines
800 B
Python
"""
|
|
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995.
|
|
Compared to a cyclic redundancy check of the same length, it trades reliability for
|
|
speed (preferring the latter).
|
|
Adler-32 is more reliable than Fletcher-16, and slightly less reliable than
|
|
Fletcher-32.[2]
|
|
|
|
source: https://en.wikipedia.org/wiki/Adler-32
|
|
"""
|
|
|
|
|
|
def adler32(plain_text: str) -> int:
|
|
"""
|
|
Function implements adler-32 hash.
|
|
Iterates and evaluates a new value for each character
|
|
|
|
>>> adler32('Algorithms')
|
|
363791387
|
|
|
|
>>> adler32('go adler em all')
|
|
708642122
|
|
"""
|
|
MOD_ADLER = 65521 # noqa: N806
|
|
a = 1
|
|
b = 0
|
|
for plain_chr in plain_text:
|
|
a = (a + ord(plain_chr)) % MOD_ADLER
|
|
b = (b + a) % MOD_ADLER
|
|
return (b << 16) | a
|