diff options
| author | Egor Tensin <Egor.Tensin@gmail.com> | 2015-05-06 06:14:54 +0300 |
|---|---|---|
| committer | Egor Tensin <Egor.Tensin@gmail.com> | 2015-05-06 06:14:54 +0300 |
| commit | d6de118675a192ce6e01574eb4eb2541db7aca7a (patch) | |
| tree | f5899b5089029fc5637435482cce5e279fa5e2ce /bubble_sort.py | |
| download | sorting-algorithms-d6de118675a192ce6e01574eb4eb2541db7aca7a.tar.gz sorting-algorithms-d6de118675a192ce6e01574eb4eb2541db7aca7a.zip | |
initial commit
Diffstat (limited to 'bubble_sort.py')
| -rw-r--r-- | bubble_sort.py | 33 |
1 files changed, 33 insertions, 0 deletions
diff --git a/bubble_sort.py b/bubble_sort.py new file mode 100644 index 0000000..8309201 --- /dev/null +++ b/bubble_sort.py @@ -0,0 +1,33 @@ +# Copyright 2015 Egor Tensin <Egor.Tensin@gmail.com> +# This file is licensed under the terms of the MIT License. +# See LICENSE.txt for details. + +def bubble_sort(xs): + while True: + swapped = False + for i in range(1, len(xs)): + if xs[i - 1] > xs[i]: + xs[i], xs[i - 1] = xs[i - 1], xs[i] + swapped = True + if not swapped: + break + return xs + +def bubble_sort_optimized(xs): + n = len(xs) + while True: + new_n = 0 + for i in range(1, n): + if xs[i - 1] > xs[i]: + xs[i], xs[i - 1] = xs[i - 1], xs[i] + new_n = i + n = new_n + if not n: + break + return xs + +if __name__ == '__main__': + import sys + xs = list(map(int, sys.argv[1:])) + print(bubble_sort(list(xs))) + print(bubble_sort_optimized(list(xs))) |
