mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-22 01:02:04 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update merge_sort_fastest.py

Browse Source 
I have modified the code a little to make it work as expected!
This commit is contained in:
Harshil 2018-05-21 10:21:33 +02:00 committed by GitHub
parent 237df47a31
commit 7f4b240d1a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
sorts/merge_sort_fastest.py
View File

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