mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 15:01:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added static type checking to polynom-for-points.py towards issue #2128 (#2335)

Browse Source 
* Added static type checking to linear_algebra/src/polynom-for-points.py

* Fixed TravisCI errors

* Update polynom-for-points.py

Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
avych 2020-09-18 12:07:49 +05:30 committed by GitHub
parent 2de2267319
commit 0dea049f44
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 9 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
linear_algebra/src/polynom-for-points.py
View File

@ -1,4 +1,7 @@
def points_to_polynomial(coordinates): from typing import List
def points_to_polynomial(coordinates: List[List[int]]) -> str:
""" """
coordinates is a two dimensional matrix: [[x, y], [x, y], ...] coordinates is a two dimensional matrix: [[x, y], [x, y], ...]
number of points you want to use number of points you want to use
@ -57,7 +60,7 @@ def points_to_polynomial(coordinates):
while count_of_line < x: while count_of_line < x:
count_in_line = 0 count_in_line = 0
a = coordinates[count_of_line][0] a = coordinates[count_of_line][0]
count_line = [] count_line: List[int] = []
while count_in_line < x: while count_in_line < x:
count_line.append(a ** (x - (count_in_line + 1))) count_line.append(a ** (x - (count_in_line + 1)))
count_in_line += 1 count_in_line += 1
@ -66,7 +69,7 @@ def points_to_polynomial(coordinates):
count_of_line = 0 count_of_line = 0
# put the y values into a vector # put the y values into a vector
vector = [] vector: List[int] = []
while count_of_line < x: while count_of_line < x:
vector.append(coordinates[count_of_line][1]) vector.append(coordinates[count_of_line][1])
count_of_line += 1 count_of_line += 1
@ -80,7 +83,7 @@ def points_to_polynomial(coordinates):
zahlen += 1 zahlen += 1
if zahlen == x: if zahlen == x:
break break
bruch = (matrix[zahlen][count]) / (matrix[count][count]) bruch = matrix[zahlen][count] / matrix[count][count]
for counting_columns, item in enumerate(matrix[count]): for counting_columns, item in enumerate(matrix[count]):
# manipulating all the values in the matrix # manipulating all the values in the matrix
matrix[zahlen][counting_columns] -= item * bruch matrix[zahlen][counting_columns] -= item * bruch
@ -91,7 +94,7 @@ def points_to_polynomial(coordinates):
count = 0 count = 0
# make solutions # make solutions
solution = [] solution: List[str] = []
while count < x: while count < x:
solution.append(vector[count] / matrix[count][count]) solution.append(vector[count] / matrix[count][count])
count += 1 count += 1
@ -100,7 +103,7 @@ def points_to_polynomial(coordinates):
solved = "f(x)=" solved = "f(x)="
while count < x: while count < x:
remove_e = str(solution[count]).split("E") remove_e: List[str] = str(solution[count]).split("E")
if len(remove_e) > 1: if len(remove_e) > 1:
solution[count] = remove_e[0] + "*10^" + remove_e[1] solution[count] = remove_e[0] + "*10^" + remove_e[1]
solved += "x^" + str(x - (count + 1)) + "*" + str(solution[count]) solved += "x^" + str(x - (count + 1)) + "*" + str(solution[count])