mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-20 20:57:35 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update sorts/bead_sort.py

Browse Source 
Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
Maxim Smolskiy 2024-04-09 01:57:38 +03:00 committed by GitHub
parent bc2225df45
commit 2c1816bf10
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
sorts/bead_sort.py
View File

@ -31,9 +31,9 @@ def bead_sort(sequence: list) -> list:
if any(not isinstance(x, int) or x < 0 for x in sequence): if any(not isinstance(x, int) or x < 0 for x in sequence):
raise TypeError("Sequence must be list of non-negative integers") raise TypeError("Sequence must be list of non-negative integers")
for _ in range(len(sequence)): for _ in range(len(sequence)):
for i in range(len(sequence) - 1): for i, (rod_upper, rod_lower) in enumerate(pairwise(sequence)):
if sequence[i] > sequence[i + 1]: if rod_upper > rod_lower:
sequence[i], sequence[i + 1] = sequence[i + 1], sequence[i] sequence[i], sequence[i + 1] = rod_lower, rod_upper
return sequence return sequence