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>
This commit is contained in:
Omkaar
2025-10-15 23:05:55 +05:30
committed by GitHub
parent 85e67302d8
commit 3cea94179d
4 changed files with 7 additions and 8 deletions

View File

@@ -99,7 +99,7 @@ We want your work to be readable by others; therefore, we encourage you to note
ruff check 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: - More on docstrings and comments:

View File

@@ -555,7 +555,7 @@ def main():
print(f"Torus: {vol_torus(2, 2) = }") # ~= 157.9 print(f"Torus: {vol_torus(2, 2) = }") # ~= 157.9
print(f"Conical Frustum: {vol_conical_frustum(2, 2, 4) = }") # ~= 58.6 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"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"Spheres union: {vol_spheres_union(2, 2, 1) = }") # ~= 45.81
print( print(
f"Hollow Circular Cylinder: {vol_hollow_circular_cylinder(1, 2, 3) = }" f"Hollow Circular Cylinder: {vol_hollow_circular_cylinder(1, 2, 3) = }"

View File

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

View File

@@ -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. Comb sort improves on bubble sort algorithm.
In bubble sort, distance (or gap) between two compared elements is always one. 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 Comb sort improvement is that gap can be much more than 1, in order to prevent slowing
down by small values down by small values at the end of a list.
at the end of a list.
More info on: https://en.wikipedia.org/wiki/Comb_sort More info on: https://en.wikipedia.org/wiki/Comb_sort