mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-17 14:58:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix

Browse Source
This commit is contained in:
MaximSmolskiy 2024-04-02 22:47:27 +03:00
parent 0135da15a0
commit bc2225df45
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
sorts/bead_sort.py
View File

@ -31,7 +31,7 @@ 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)): for i in range(len(sequence) - 1):
if sequence[i] > sequence[i + 1]: if sequence[i] > sequence[i + 1]:
sequence[i], sequence[i + 1] = sequence[i + 1], sequence[i] sequence[i], sequence[i + 1] = sequence[i + 1], sequence[i]
return sequence return sequence