Fixed some invalid references and more spelling errors. (keon#786)

cliftonamccook · web-flow · commit 5dde6a0f18af · 2021-05-30T19:24:09.000-07:00
* Corrected spelling anf grammar errors in docstring for heap.

* Fixed method signature for remove_min by removing unused parameter i.

* Fixed grammar in min_child docstring.

* Fixed spelling error.

* Fixed spelling errors in matrix_exponentiation.py

* Removed trailing semicolons in matrix_inversion.py. TODO: Check for possible type error in line 61.

* Fixed spelling error in base_conversion.py.

* Fixed incorrect reference in min_height.py

* Fixed incorrect reference in max_height.py
diff --git a/algorithms/linkedlist/linkedlist.py b/algorithms/linkedlist/linkedlist.py
@@ -3,7 +3,7 @@
 # in comparison, arrays require O(n) time to do the same thing.
 # Linked lists can continue to expand without having to specify
 # their size ahead of time (remember our lectures on Array sizing
-# form the Array Sequence section of the course!)
+# from the Array Sequence section of the course!)
 
 # Cons
 # To access an element in a linked list, you need to take O(k) time
diff --git a/algorithms/maths/base_conversion.py b/algorithms/maths/base_conversion.py
@@ -33,7 +33,7 @@ def int_to_base(n, base):
 
 def base_to_int(s, base):
     """
-        Note : You can use int() built-in function instread of this.
+        Note : You can use int() built-in function instead of this.
         :type s: str
         :type base: int
         :rtype: int
diff --git a/algorithms/matrix/matrix_exponentiation.py b/algorithms/matrix/matrix_exponentiation.py
@@ -16,7 +16,7 @@ def multiply(matA: list, matB: list) -> list:
 def identity(n: int) -> list:
     """
     Returns the Identity matrix of size n x n
-    Time Complecity: O(n^2)
+    Time Complexity: O(n^2)
     """
     I = [[0 for i in range(n)] for j in range(n)]
     
@@ -29,7 +29,7 @@ def matrix_exponentiation(mat: list, n: int) -> list:
     """
     Calculates mat^n by repeated squaring
     Time Complexity: O(d^3 log(n))
-                     d: dimesion of the square matrix mat
+                     d: dimension of the square matrix mat
                      n: power the matrix is raised to
     """
     if n == 0:
diff --git a/algorithms/matrix/matrix_inversion.py b/algorithms/matrix/matrix_inversion.py
@@ -28,16 +28,16 @@ def invert_matrix(m):
     # Error conditions
     if not array_is_matrix(m):
         print("Invalid matrix: array is not a matrix")
-        return [[-1]];
+        return [[-1]]
     elif len(m) != len(m[0]):
         print("Invalid matrix: matrix is not square")
-        return [[-2]];
+        return [[-2]]
     elif len(m) < 2:
         print("Invalid matrix: matrix is too small")
-        return [[-3]];
+        return [[-3]]
     elif get_determinant(m) == 0:
         print("Invalid matrix: matrix is square, but singular (determinant = 0)")
-        return [[-4]];
+        return [[-4]]
 
     # Calculation
     elif len(m) == 2:
diff --git a/algorithms/tree/max_height.py b/algorithms/tree/max_height.py
@@ -12,7 +12,7 @@
 
 # iterative
 
-from tree.tree import TreeNode
+from tree import TreeNode
 
 
 def max_height(root):
diff --git a/algorithms/tree/min_height.py b/algorithms/tree/min_height.py
@@ -1,4 +1,4 @@
-from tree.tree import TreeNode
+from tree import TreeNode
 
 
 def min_depth(self, root):

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-from tree.tree import TreeNode`
	`1`	`+from tree import TreeNode`
`2`	`2`
`3`	`3`
`4`	`4`	`def min_depth(self, root):`