Fix a few typos (#13346)

* Fix typo in spheres intersection print statement

* Fix typo in CONTRIBUTING.md

* Improve comments in comb_sort.py

* pyproject.toml: tool.ruff.target-version = "py314"

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Fix comment formatting in lint.ignore section

---------

Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>

CONTRIBUTING.md

@@ -99,7 +99,7 @@ We want your work to be readable by others; therefore, we encourage you to note
   ruff check
   ```
 
-- Original code submission require docstrings or comments to describe your work.
+- Original code submissions require docstrings or comments to describe your work.
 
 - More on docstrings and comments:
 

maths/volume.py

@@ -555,7 +555,7 @@ def main():
     print(f"Torus: {vol_torus(2, 2) = }")  # ~= 157.9
     print(f"Conical Frustum: {vol_conical_frustum(2, 2, 4) = }")  # ~= 58.6
     print(f"Spherical cap: {vol_spherical_cap(1, 2) = }")  # ~= 5.24
-    print(f"Spheres intersetion: {vol_spheres_intersect(2, 2, 1) = }")  # ~= 21.21
+    print(f"Spheres intersection: {vol_spheres_intersect(2, 2, 1) = }")  # ~= 21.21
     print(f"Spheres union: {vol_spheres_union(2, 2, 1) = }")  # ~= 45.81
     print(
         f"Hollow Circular Cylinder: {vol_hollow_circular_cylinder(1, 2, 3) = }"

pyproject.toml

@@ -3,10 +3,9 @@ name = "thealgorithms-python"
 version = "0.0.1"
 description = "TheAlgorithms in Python"
 authors = [ { name = "TheAlgorithms Contributors" } ]
-requires-python = ">=3.13"
+requires-python = ">=3.14"
 classifiers = [
   "Programming Language :: Python :: 3 :: Only",
-  "Programming Language :: Python :: 3.13",
 ]
 dependencies = [
   "beautifulsoup4>=4.12.3",
@@ -49,7 +48,7 @@ euler-validate = [
 ]
 
 [tool.ruff]
-target-version = "py313"
+target-version = "py314"
 
 output-format = "full"
 lint.select = [
@@ -110,7 +109,7 @@ lint.ignore = [
   # `ruff rule S101` for a description of that rule
   "B904",    # Within an `except` clause, raise exceptions with `raise ... from err` -- FIX ME
   "B905",    # `zip()` without an explicit `strict=` parameter -- FIX ME
-  "EM101",   # Exception must not use a string literal, assign to variable first
+  "EM101",   # Exception must not use a string literal, assign to a variable first
   "EXE001",  # Shebang is present but file is not executable -- DO NOT FIX
   "G004",    # Logging statement uses f-string
   "ISC001",  # Conflicts with ruff format -- DO NOT FIX
@@ -126,6 +125,7 @@ lint.ignore = [
   "S311",    # Standard pseudo-random generators are not suitable for cryptographic purposes -- FIX ME
   "SIM905",  # Consider using a list literal instead of `str.split` -- DO NOT FIX
   "SLF001",  # Private member accessed: `_Iterator` -- FIX ME
+  "UP037",   # FIX ME
 ]
 
 lint.per-file-ignores."data_structures/hashing/tests/test_hash_map.py" = [

sorts/comb_sort.py

@@ -5,8 +5,7 @@ Dobosiewicz in 1980.  It was rediscovered by Stephen Lacey and Richard Box in 19
 Comb sort improves on bubble sort algorithm.
 In bubble sort, distance (or gap) between two compared elements is always one.
 Comb sort improvement is that gap can be much more than 1, in order to prevent slowing
-down by small values
-at the end of a list.
+down by small values at the end of a list.
 
 More info on: https://en.wikipedia.org/wiki/Comb_sort