algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-06 18:49:26 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add typehints to blockchain (#3149)

Browse Source 
* updating DIRECTORY.md

* updating DIRECTORY.md

* Added type hints to blockchain algorithms

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Jenia Dysin
2020-11-29 18:20:54 +02:00
committed by GitHub
parent e07766230d
commit 0febbd397e
3 changed files with 14 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
blockchain/modular_division.py
View File

@ -14,7 +14,7 @@
# Uses ExtendedEuclid to find the inverse of a
def modular_division(a, b, n):
def modular_division(a: int, b: int, n: int) -> int:
"""
>>> modular_division(4,8,5)
2
@ -33,7 +33,7 @@ def modular_division(a, b, n):
# This function find the inverses of a i.e., a^(-1)
def invert_modulo(a, n):
def invert_modulo(a: int, n: int) -> int:
"""
>>> invert_modulo(2, 5)
3
@ -51,7 +51,7 @@ def invert_modulo(a, n):
# ------------------ Finding Modular division using invert_modulo -------------------
# This function used the above inversion of a to find x = (b*a^(-1))mod n
def modular_division2(a, b, n):
def modular_division2(a: int, b: int, n: int) -> int:
"""
>>> modular_division2(4,8,5)
2
@ -72,7 +72,7 @@ def modular_division2(a, b, n):
# and y, then d = gcd(a,b)
def extended_gcd(a, b):
def extended_gcd(a: int, b: int) -> (int, int, int):
"""
>>> extended_gcd(10, 6)
(2, -1, 2)
@ -99,7 +99,7 @@ def extended_gcd(a, b):
# Extended Euclid
def extended_euclid(a, b):
def extended_euclid(a: int, b: int) -> (int, int):
"""
>>> extended_euclid(10, 6)
(-1, 2)
@ -119,7 +119,7 @@ def extended_euclid(a, b):
# Euclid's Algorithm
def greatest_common_divisor(a, b):
def greatest_common_divisor(a: int, b: int) -> int:
"""
>>> greatest_common_divisor(7,5)
1