Skip to content

Commit 2a080f2

Browse files
[pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
1 parent 163b615 commit 2a080f2

1 file changed

Lines changed: 2 additions & 6 deletions

File tree

sorts/cyclic_sort.py

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ def cyclic_sort(nums: list[int]) -> list[int]:
2828
>>> cyclic_sort([3, 5, 2, 1, 4])
2929
[1, 2, 3, 4, 5]
3030
>>> cyclic_sort([1, 2, 5])
31-
31+
3232
Traceback (most recent call last):
3333
...
3434
ValueError: All numbers must be in range 1 to 3, got 5
@@ -47,13 +47,10 @@ def cyclic_sort(nums: list[int]) -> list[int]:
4747
raise ValueError(f"All numbers must be unique, got {nums}")
4848

4949
if num < 1 or num > n:
50-
raise ValueError(
51-
f"All numbers must be in range 1 to {n}, got {num}"
52-
)
50+
raise ValueError(f"All numbers must be in range 1 to {n}, got {num}")
5351

5452
seen.add(num)
5553

56-
5754
# Perform cyclic sort
5855
index = 0
5956
while index < len(nums):
@@ -74,7 +71,6 @@ def cyclic_sort(nums: list[int]) -> list[int]:
7471
if __name__ == "__main__":
7572
import doctest
7673

77-
7874
doctest.testmod()
7975
user_input = input("Enter numbers separated by a comma:\n").strip()
8076
unsorted = [int(item) for item in user_input.split(",")]

0 commit comments

Comments
 (0)