From 2183f3f860af34e45058ef078045322062b51f42 Mon Sep 17 00:00:00 2001 From: Egor Tensin Date: Sun, 17 Apr 2016 00:49:33 +0300 Subject: 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. --- selection_sort.py | 17 ----------------- 1 file changed, 17 deletions(-) delete mode 100644 selection_sort.py (limited to 'selection_sort.py') diff --git a/selection_sort.py b/selection_sort.py deleted file mode 100644 index c466bea..0000000 --- a/selection_sort.py +++ /dev/null @@ -1,17 +0,0 @@ -# Copyright 2015 Egor Tensin -# This file is licensed under the terms of the MIT License. -# See LICENSE.txt for details. - -def selection_sort(xs): - for i in range(len(xs) - 1): - min_i = i - for j in range(i + 1, len(xs)): - if xs[j] < xs[min_i]: - min_i = j - if min_i != i: - xs[i], xs[min_i] = xs[min_i], xs[i] - return xs - -if __name__ == '__main__': - import sys - print(selection_sort(list(map(int, sys.argv[1:])))) -- cgit v1.3