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, 15 deletions

diff --git a/insertion_sort.py b/insertion_sort.py
deleted file mode 100644
index 9e0912d..0000000
--- a/insertion_sort.py
+++ /dev/null
@@ -1,15 +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 insertion_sort(xs):
-    for i in range(1, len(xs)):
-        j = i
-        while j > 0 and xs[j - 1] > xs[j]:
-            xs[j], xs[j - 1] = xs[j - 1], xs[j]
-            j -= 1
-    return xs
-
-if __name__ == '__main__':
-    import sys
-    print(insertion_sort(list(map(int, sys.argv[1:]))))