OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update merge_sort_fastest.py

Browse Source
This commit is contained in:
Harshil 2018-05-21 10:28:37 +02:00 committed by GitHub
parent 7f4b240d1a
commit 71fd719ab7
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
sorts/merge_sort_fastest.py
View File

@ -7,15 +7,13 @@ Worst Case Scenario : O(n)
def merge_sort(LIST): def merge_sort(LIST):
start = [] start = []
end = [] end = []
while LIST: while len(LIST) > 1:
a = min(LIST) a = min(LIST)
b = max(LIST) b = max(LIST)
start.append(a) start.append(a)
end.append(b) end.append(b)
try: LIST.remove(a)
LIST.remove(a) LIST.remove(b)
LIST.remove(b) if LIST: start.append(LIST[0])
except ValueError:
continue
end.reverse() end.reverse()
return (start + end) return (start + end)