rearrange source files

* Add a useful `algorithms` package to provide convinient access to the
implemented algorithms.
* This allows to e.g. dynamically list available algorithms, which
greatly simplifies a lot of things.

1 files changed, 0 insertions, 33 deletions

diff --git a/bubble_sort.py b/bubble_sort.py
deleted file mode 100644
index 8309201..0000000
--- a/bubble_sort.py
+++ /dev/null
@@ -1,33 +0,0 @@
-# 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)))