Add basic sorting algorithms

This commit is contained in:
Matthew Grove
2019-06-12 16:26:13 +01:00
parent 25cd240948
commit b2bba0a86b
3 changed files with 22 additions and 1 deletions

12
selective-sort.py Normal file
View File

@@ -0,0 +1,12 @@
original = [24, 10, 40, 28, 31, 9, 29, 42, 39, 19, 18, 37, 11, 14, 49, 47, 22, 16, 38, 6, 4, 27, 21, 48, 35, 23, 17, 1, 44, 25, 41, 2, 46, 30, 8, 50, 32, 5, 20, 33, 34, 26, 36, 12, 43, 15, 45, 7, 3, 13]
new = []
print("Original list:", original)
for x in range(0, len(original)):
for i, item in enumerate(original):
if i == 0:
lowest = 0
elif original[i] < original[lowest]:
lowest = i
new.append(original[lowest])
original.pop(lowest)
print("New list:", new)