Created a selection sort algorithm as a proof of concept. n^2 complexity,

so grab a coffee if you decide to run it against a large array!

1 files changed, 0 insertions, 25 deletions

diff --git a/tester.py b/tester.py
deleted file mode 100755
index e44982f..0000000
--- a/tester.py
+++ /dev/null
@@ -1,25 +0,0 @@
-#!/bin/python3
-
-# ---------- Testing script
-# Uses command line arguments to call functions
-
-
-# ---------- Imported modules
-
-import inputoutput as io
-import csv
-import sys
-
-# ---------- Main
-
-# command line args passed to variables
-rspan = int(sys.argv[1])
-rlim = int(sys.argv[2])
-ofile =sys.argv[3]
-
-print("Your params:\n")
-print("\tCSV size: {}".format(rspan))
-print("\tNumber range: 1 - {}".format(rlim))
-print("\tOutput file: {}".format(ofile))
-print("\nGenerating a CSV!")
-io.generateCSV(rspan,rlim,ofile)