me/small-projects
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add comments

Browse Source
This commit is contained in:
Matthew Grove
2019-06-26 08:53:47 +01:00
parent ff932e59ef
commit 094bdee618
3 changed files with 76 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
insertion-sort.py
View File

@@ -1,8 +1,12 @@
array = [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]
print("Original array:", array)
for i in range(0, len(array)):
# selective sort algorithm
# list to be sorted
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]
print("Original list:", original)
for i in range(0, len(original)):
j = 0
while array[i] > array[j]:
while original[i] > original[j]:
j += 1
array.insert(j, array.pop(i))
print("New array:", array)
original.insert(j, original.pop(i))
print("New list:", original)