TheAlgorithms · dhruvmanila · Mar 20, 2021 · Mar 19, 2021 · Mar 19, 2021
@@ -1,6 +1,6 @@
 repos:
   - repo: https://github.com/pre-commit/pre-commit-hooks
-    rev: v3.2.0
+    rev: v3.4.0
     hooks:
       - id: check-executables-have-shebangs
       - id: check-yaml
@@ -13,17 +13,17 @@ repos:
           )$
       - id: requirements-txt-fixer
   - repo: https://github.com/psf/black
-    rev: stable
+    rev: 20.8b1
     hooks:
       - id: black
   - repo: https://github.com/PyCQA/isort
-    rev: 5.5.3
+    rev: 5.7.0
     hooks:
       - id: isort
         args:
           - --profile=black
   - repo: https://gitlab.com/pycqa/flake8
-    rev: 3.8.3
+    rev: 3.9.0
     hooks:
       - id: flake8
         args:
@@ -38,11 +38,11 @@ repos:
 #          args:
 #            - --ignore-missing-imports
   - repo: https://github.com/codespell-project/codespell
-    rev: v1.17.1
+    rev: v2.0.0
     hooks:
       - id: codespell
         args:
-          - --ignore-words-list=ans,fo,followings,hist,iff,mater,secant,som,tim
+          - --ignore-words-list=ans,crate,fo,followings,hist,iff,mater,secant,som,tim
           - --skip="./.*,./other/dictionary.txt,./other/words,./project_euler/problem_022/p022_names.txt"
           - --quiet-level=2
         exclude: |

diff --git a/DIRECTORY.md b/DIRECTORY.md
@@ -472,6 +472,7 @@
   * [Runge Kutta](https://github.com/TheAlgorithms/Python/blob/master/maths/runge_kutta.py)
   * [Segmented Sieve](https://github.com/TheAlgorithms/Python/blob/master/maths/segmented_sieve.py)
   * Series
+    * [Arithmetic Mean](https://github.com/TheAlgorithms/Python/blob/master/maths/series/arithmetic_mean.py)
     * [Geometric Mean](https://github.com/TheAlgorithms/Python/blob/master/maths/series/geometric_mean.py)
     * [Geometric Series](https://github.com/TheAlgorithms/Python/blob/master/maths/series/geometric_series.py)
     * [Harmonic Series](https://github.com/TheAlgorithms/Python/blob/master/maths/series/harmonic_series.py)

diff --git a/machine_learning/k_nearest_neighbours.py b/machine_learning/k_nearest_neighbours.py
@@ -32,7 +32,7 @@ def classifier(train_data, train_target, classes, point, k=5):
     :train_data: Set of points that are classified into two or more classes
     :train_target: List of classes in the order of train_data points
     :classes: Labels of the classes
-    :point: The data point that needs to be classifed
+    :point: The data point that needs to be classified
 
     >>> X_train = [[0, 0], [1, 0], [0, 1], [0.5, 0.5], [3, 3], [2, 3], [3, 2]]
     >>> y_train = [0, 0, 0, 0, 1, 1, 1]

diff --git a/maths/polynomial_evaluation.py b/maths/polynomial_evaluation.py
@@ -5,7 +5,7 @@ def evaluate_poly(poly: Sequence[float], x: float) -> float:
     """Evaluate a polynomial f(x) at specified point x and return the value.
 
     Arguments:
-    poly -- the coeffiecients of a polynomial as an iterable in order of
+    poly -- the coefficients of a polynomial as an iterable in order of
             ascending degree
     x -- the point at which to evaluate the polynomial
 
@@ -26,7 +26,7 @@ def horner(poly: Sequence[float], x: float) -> float:
     https://en.wikipedia.org/wiki/Horner's_method
 
     Arguments:
-    poly -- the coeffiecients of a polynomial as an iterable in order of
+    poly -- the coefficients of a polynomial as an iterable in order of
             ascending degree
     x -- the point at which to evaluate the polynomial
 

diff --git a/searches/hill_climbing.py b/searches/hill_climbing.py
@@ -60,7 +60,7 @@ def get_neighbors(self):
 
     def __hash__(self):
         """
-        hash the string represetation of the current search state.
+        hash the string representation of the current search state.
         """
         return hash(str(self))