We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent bc2225d commit 2c1816bCopy full SHA for 2c1816b
sorts/bead_sort.py
@@ -31,9 +31,9 @@ def bead_sort(sequence: list) -> list:
31
if any(not isinstance(x, int) or x < 0 for x in sequence):
32
raise TypeError("Sequence must be list of non-negative integers")
33
for _ in range(len(sequence)):
34
- for i in range(len(sequence) - 1):
35
- if sequence[i] > sequence[i + 1]:
36
- sequence[i], sequence[i + 1] = sequence[i + 1], sequence[i]
+ for i, (rod_upper, rod_lower) in enumerate(pairwise(sequence)):
+ if rod_upper > rod_lower:
+ sequence[i], sequence[i + 1] = rod_lower, rod_upper
37
return sequence
38
39
0 commit comments