Algorithms/selectionSort.py at master · williammortl/Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
# Selection Sort Algorithm
# Implemented by William M Mortl
# O(n ^ 2)
# python selectionSort.py "9,111,2,31,7,0,5,4,3,1,100001,32,31,27,16,15,999,3,3,3,3,100000000,7"

# imports
from copy import deepcopy
from mergeSort import mergeSort
import sys

# in place selection sort
def selectionSort(listToSort):
	for i in range(0, len(listToSort)):
		minIndex = i
		for j in range(i, len(listToSort)):
			if (listToSort[j] <= listToSort[minIndex]):
				minIndex = j
		tmp = listToSort[i]
		listToSort[i] = listToSort[minIndex]
		listToSort[minIndex] = tmp
	return listToSort

# main entry point
if __name__ == "__main__":
	if (len(sys.argv) < 2):
		print("\r\nSelection Sort by William M Mortl")
		print("Usage: python selectionSort.py \"{comma seperated list of values to sort}\"")
		print("Example: python selectionSort.py \"9,111,2,31,1,0\"\r\n")
	else:
		listToSort = list(map(int, sys.argv[1].split(",")))
		print("\r\nSorting:\r\n{}\r\n".format(listToSort))
		mergeSorted = mergeSort(deepcopy(listToSort))
		selectionSorted = selectionSort(deepcopy(listToSort))
		print("Merge Sorted list:\r\n{}\r\n".format(mergeSorted))
		print("Selection Sorted list:\r\n{}\r\n".format(selectionSorted))
		print("Lists equal? {}\r\n".format(mergeSorted == selectionSorted))