Skip to content

Commit eb5e9dc

Browse files
author
Pranav
committed
Address Ruff linting feedback
1 parent 21b512a commit eb5e9dc

1 file changed

Lines changed: 5 additions & 3 deletions

File tree

sorts/cyclic_sort.py

Lines changed: 5 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -30,7 +30,7 @@ def cyclic_sort(nums: list[int]) -> list[int]:
3030
>>> cyclic_sort([1, 2, 5])
3131
Traceback (most recent call last):
3232
...
33-
ValueError: All numbers must be in range 1 and 3, got 5.
33+
ValueError: All numbers must be in range 1 to 3, got 5.
3434
3535
>>> cyclic_sort([7, 3, 2, 3, 54, 5, 4])
3636
Traceback (most recent call last):
@@ -40,10 +40,12 @@ def cyclic_sort(nums: list[int]) -> list[int]:
4040
# Reject invalid input to prevent infinite loops and invalid indexing.
4141
n = len(nums)
4242
if len(set(nums)) != n:
43-
raise ValueError(f"All numbers must be unique, got {nums}.")
43+
err=f"All numbers must be unique, got {nums}."
44+
raise ValueError(err)
4445
for num in nums:
4546
if not 1 <= num <= n:
46-
raise ValueError(f"All numbers must be in range 1 and {n}, got {num}.")
47+
err=f"All numbers must be in range 1 to {n}, got {num}."
48+
raise ValueError(err)
4749
# Perform cyclic sort
4850
index = 0
4951
while index < n:

0 commit comments

Comments
 (0)