>>> bead_sort([6, 11, 12, 4, 1, 5]) [1, 4, 5, 6, 11, 12] >>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1]) [1, 2, 3, 4, 5, 6, 7, 8, 9] >>> bead_sort([5, 0, 4, 3]) [0, 3, 4, 5] >>> bead_sort([8, 2, 1]) [1, 2, 8] >>> bead_sort([1, .9, 0.0, 0, -1, -.9]) Traceback (
(sequence: list)
| 5 | |
| 6 | |
| 7 | def bead_sort(sequence: list) -> list: |
| 8 | """ |
| 9 | >>> bead_sort([6, 11, 12, 4, 1, 5]) |
| 10 | [1, 4, 5, 6, 11, 12] |
| 11 | |
| 12 | >>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1]) |
| 13 | [1, 2, 3, 4, 5, 6, 7, 8, 9] |
| 14 | |
| 15 | >>> bead_sort([5, 0, 4, 3]) |
| 16 | [0, 3, 4, 5] |
| 17 | |
| 18 | >>> bead_sort([8, 2, 1]) |
| 19 | [1, 2, 8] |
| 20 | |
| 21 | >>> bead_sort([1, .9, 0.0, 0, -1, -.9]) |
| 22 | Traceback (most recent call last): |
| 23 | ... |
| 24 | TypeError: Sequence must be list of non-negative integers |
| 25 | |
| 26 | >>> bead_sort("Hello world") |
| 27 | Traceback (most recent call last): |
| 28 | ... |
| 29 | TypeError: Sequence must be list of non-negative integers |
| 30 | """ |
| 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, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])): # noqa: RUF007 |
| 35 | if rod_upper > rod_lower: |
| 36 | sequence[i] -= rod_upper - rod_lower |
| 37 | sequence[i + 1] += rod_upper - rod_lower |
| 38 | return sequence |
| 39 | |
| 40 | |
| 41 | if __name__ == "__main__": |